./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50aaa9c38941e3902867fed1ab11249c92826155dddcdcedd0a40439bce25b5e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:12:13,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:12:14,018 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:12:14,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:12:14,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:12:14,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:12:14,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:12:14,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:12:14,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:12:14,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:12:14,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:12:14,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:12:14,083 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:12:14,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:12:14,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:12:14,087 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:12:14,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:12:14,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:12:14,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:12:14,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:12:14,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:12:14,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:12:14,097 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:12:14,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:12:14,098 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:12:14,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:12:14,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:12:14,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:12:14,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:12:14,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:12:14,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:12:14,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:12:14,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:12:14,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:12:14,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:12:14,104 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:12:14,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:12:14,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:12:14,105 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:12:14,105 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50aaa9c38941e3902867fed1ab11249c92826155dddcdcedd0a40439bce25b5e [2023-11-12 02:12:14,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:12:14,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:12:14,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:12:14,478 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:12:14,479 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:12:14,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i [2023-11-12 02:12:17,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:12:17,856 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:12:17,856 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i [2023-11-12 02:12:17,867 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/data/214c018f1/50dec3ba8ae3469da48817fc687820a4/FLAGe265c34f0 [2023-11-12 02:12:17,882 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/data/214c018f1/50dec3ba8ae3469da48817fc687820a4 [2023-11-12 02:12:17,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:12:17,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:12:17,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:12:17,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:12:17,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:12:17,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:12:17" (1/1) ... [2023-11-12 02:12:17,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d62c479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:17, skipping insertion in model container [2023-11-12 02:12:17,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:12:17" (1/1) ... [2023-11-12 02:12:17,927 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:12:18,067 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i[916,929] [2023-11-12 02:12:18,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:12:18,150 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:12:18,163 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i[916,929] [2023-11-12 02:12:18,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:12:18,243 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:12:18,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18 WrapperNode [2023-11-12 02:12:18,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:12:18,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:12:18,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:12:18,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:12:18,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,324 INFO L138 Inliner]: procedures = 26, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2023-11-12 02:12:18,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:12:18,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:12:18,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:12:18,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:12:18,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:12:18,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:12:18,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:12:18,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:12:18,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (1/1) ... [2023-11-12 02:12:18,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:12:18,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:12:18,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:12:18,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb53fe30-e61c-40cd-9573-e9a81cd48029/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:12:18,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:12:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:12:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:12:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:12:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:12:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:12:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:12:18,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:12:18,584 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:12:18,586 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:12:19,168 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:12:19,181 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:12:19,183 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:12:19,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:19 BoogieIcfgContainer [2023-11-12 02:12:19,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:12:19,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:12:19,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:12:19,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:12:19,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:12:17" (1/3) ... [2023-11-12 02:12:19,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d10138d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:12:19, skipping insertion in model container [2023-11-12 02:12:19,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:18" (2/3) ... [2023-11-12 02:12:19,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d10138d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:12:19, skipping insertion in model container [2023-11-12 02:12:19,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:19" (3/3) ... [2023-11-12 02:12:19,202 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-32.i [2023-11-12 02:12:19,226 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:12:19,227 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:12:19,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:12:19,287 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@de47627, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:12:19,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:12:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 79 states have internal predecessors, (107), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:12:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-12 02:12:19,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:19,309 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:19,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:19,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash 331903658, now seen corresponding path program 1 times [2023-11-12 02:12:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418296880] [2023-11-12 02:12:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:12:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:12:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:12:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:12:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:12:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:12:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:12:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:12:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:12:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:12:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:12:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:12:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:12:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:12:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418296880] [2023-11-12 02:12:19,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418296880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:19,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:19,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:12:19,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378093451] [2023-11-12 02:12:19,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:19,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:12:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:20,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:12:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:12:20,048 INFO L87 Difference]: Start difference. First operand has 99 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 79 states have internal predecessors, (107), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:12:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:20,097 INFO L93 Difference]: Finished difference Result 191 states and 298 transitions. [2023-11-12 02:12:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:12:20,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2023-11-12 02:12:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:20,108 INFO L225 Difference]: With dead ends: 191 [2023-11-12 02:12:20,109 INFO L226 Difference]: Without dead ends: 95 [2023-11-12 02:12:20,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:12:20,117 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:20,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-12 02:12:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-12 02:12:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:12:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2023-11-12 02:12:20,171 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2023-11-12 02:12:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:20,172 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2023-11-12 02:12:20,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:12:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2023-11-12 02:12:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-12 02:12:20,177 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:20,177 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:20,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:12:20,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:20,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash -718817914, now seen corresponding path program 1 times [2023-11-12 02:12:20,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:20,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354546693] [2023-11-12 02:12:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:20,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:12:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:12:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:12:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:12:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:12:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:12:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:12:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:12:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:12:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:12:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:12:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:12:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:12:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:12:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354546693] [2023-11-12 02:12:20,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354546693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:20,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:20,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:12:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356924173] [2023-11-12 02:12:20,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:20,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:12:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:20,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:12:20,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:12:20,675 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:12:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:20,916 INFO L93 Difference]: Finished difference Result 280 states and 391 transitions. [2023-11-12 02:12:20,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:12:20,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2023-11-12 02:12:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:20,922 INFO L225 Difference]: With dead ends: 280 [2023-11-12 02:12:20,925 INFO L226 Difference]: Without dead ends: 188 [2023-11-12 02:12:20,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:20,930 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 91 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:20,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 324 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:12:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-12 02:12:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 157. [2023-11-12 02:12:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 118 states have (on average 1.2457627118644068) internal successors, (147), 118 states have internal predecessors, (147), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:12:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 219 transitions. [2023-11-12 02:12:20,968 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 219 transitions. Word has length 129 [2023-11-12 02:12:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:20,969 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 219 transitions. [2023-11-12 02:12:20,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:12:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 219 transitions. [2023-11-12 02:12:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-12 02:12:20,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:20,973 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:20,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:12:20,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:20,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1156097248, now seen corresponding path program 1 times [2023-11-12 02:12:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:20,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076688003] [2023-11-12 02:12:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:20,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:12:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:12:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:12:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:12:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:12:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:12:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:12:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:12:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:12:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:12:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:12:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:12:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:12:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:12:23,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:23,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076688003] [2023-11-12 02:12:23,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076688003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:23,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:23,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 02:12:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630674598] [2023-11-12 02:12:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:23,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:12:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:12:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:12:23,291 INFO L87 Difference]: Start difference. First operand 157 states and 219 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:12:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:24,856 INFO L93 Difference]: Finished difference Result 365 states and 516 transitions. [2023-11-12 02:12:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:12:24,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2023-11-12 02:12:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:24,865 INFO L225 Difference]: With dead ends: 365 [2023-11-12 02:12:24,865 INFO L226 Difference]: Without dead ends: 273 [2023-11-12 02:12:24,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-11-12 02:12:24,870 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 389 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:24,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 798 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-12 02:12:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-12 02:12:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 189. [2023-11-12 02:12:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.3) internal successors, (195), 150 states have internal predecessors, (195), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:12:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2023-11-12 02:12:24,938 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 137 [2023-11-12 02:12:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:24,940 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2023-11-12 02:12:24,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:12:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2023-11-12 02:12:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-12 02:12:24,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:24,949 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:24,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:12:24,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:24,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:24,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1242605664, now seen corresponding path program 1 times [2023-11-12 02:12:24,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:24,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598979552] [2023-11-12 02:12:24,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:12:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:12:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:12:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:12:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:12:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:12:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:12:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:12:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:12:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:12:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:12:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:12:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:12:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:12:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598979552] [2023-11-12 02:12:26,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598979552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:26,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:26,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-12 02:12:26,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193352240] [2023-11-12 02:12:26,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:26,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 02:12:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 02:12:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:12:26,810 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:12:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:28,373 INFO L93 Difference]: Finished difference Result 406 states and 574 transitions. [2023-11-12 02:12:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:12:28,374 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2023-11-12 02:12:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:28,377 INFO L225 Difference]: With dead ends: 406 [2023-11-12 02:12:28,378 INFO L226 Difference]: Without dead ends: 295 [2023-11-12 02:12:28,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2023-11-12 02:12:28,386 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 449 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:28,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 772 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-12 02:12:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-12 02:12:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2023-11-12 02:12:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.3) internal successors, (195), 150 states have internal predecessors, (195), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:12:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2023-11-12 02:12:28,434 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 138 [2023-11-12 02:12:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:28,435 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2023-11-12 02:12:28,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:12:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2023-11-12 02:12:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-12 02:12:28,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:28,438 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:28,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:12:28,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:28,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1038102055, now seen corresponding path program 1 times [2023-11-12 02:12:28,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:28,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126578001] [2023-11-12 02:12:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:28,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:12:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:12:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:12:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:12:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:12:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:12:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:12:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:12:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:12:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:12:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:12:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:12:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:12:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:12:31,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126578001] [2023-11-12 02:12:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126578001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:31,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:31,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-12 02:12:31,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736879366] [2023-11-12 02:12:31,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:31,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 02:12:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:31,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 02:12:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-11-12 02:12:31,943 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 8 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-12 02:12:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:34,389 INFO L93 Difference]: Finished difference Result 391 states and 554 transitions. [2023-11-12 02:12:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:12:34,391 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 8 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 139 [2023-11-12 02:12:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:34,394 INFO L225 Difference]: With dead ends: 391 [2023-11-12 02:12:34,394 INFO L226 Difference]: Without dead ends: 280 [2023-11-12 02:12:34,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2023-11-12 02:12:34,401 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 555 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:34,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 709 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-12 02:12:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-12 02:12:34,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 212. [2023-11-12 02:12:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 173 states have (on average 1.329479768786127) internal successors, (230), 173 states have internal predecessors, (230), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:12:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 302 transitions. [2023-11-12 02:12:34,477 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 302 transitions. Word has length 139 [2023-11-12 02:12:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:34,478 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 302 transitions. [2023-11-12 02:12:34,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 8 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-12 02:12:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 302 transitions. [2023-11-12 02:12:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-12 02:12:34,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:34,481 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:34,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:12:34,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:34,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:34,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1341832277, now seen corresponding path program 1 times [2023-11-12 02:12:34,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:34,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620826759] [2023-11-12 02:12:34,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:34,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:12:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:12:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:12:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:12:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:12:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:12:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:12:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:12:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:12:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:12:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:12:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:12:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:12:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:12:34,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:34,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620826759] [2023-11-12 02:12:34,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620826759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:34,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:34,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:34,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796029572] [2023-11-12 02:12:34,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:34,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:34,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:34,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:34,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:34,769 INFO L87 Difference]: Start difference. First operand 212 states and 302 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:12:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:34,862 INFO L93 Difference]: Finished difference Result 350 states and 499 transitions. [2023-11-12 02:12:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:34,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2023-11-12 02:12:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:34,867 INFO L225 Difference]: With dead ends: 350 [2023-11-12 02:12:34,867 INFO L226 Difference]: Without dead ends: 224 [2023-11-12 02:12:34,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:12:34,871 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 60 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:34,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 485 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-12 02:12:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 215. [2023-11-12 02:12:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 176 states have (on average 1.3238636363636365) internal successors, (233), 176 states have internal predecessors, (233), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:12:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 305 transitions. [2023-11-12 02:12:34,929 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 305 transitions. Word has length 139 [2023-11-12 02:12:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:34,930 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 305 transitions. [2023-11-12 02:12:34,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:12:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 305 transitions. [2023-11-12 02:12:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-12 02:12:34,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:34,934 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:34,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:12:34,934 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:34,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:34,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1179497433, now seen corresponding path program 1 times [2023-11-12 02:12:34,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94918375] [2023-11-12 02:12:34,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:34,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:40,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:12:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:12:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:40,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:12:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:40,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:40,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:12:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:12:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:12:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:12:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:12:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:12:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:12:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:12:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:12:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:12:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:12:41,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:41,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94918375] [2023-11-12 02:12:41,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94918375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:41,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:41,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2023-11-12 02:12:41,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073206963] [2023-11-12 02:12:41,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:41,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-12 02:12:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:41,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 02:12:41,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2023-11-12 02:12:41,214 INFO L87 Difference]: Start difference. First operand 215 states and 305 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 10 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2023-11-12 02:12:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:46,348 INFO L93 Difference]: Finished difference Result 641 states and 895 transitions. [2023-11-12 02:12:46,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-12 02:12:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 10 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 139 [2023-11-12 02:12:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:46,354 INFO L225 Difference]: With dead ends: 641 [2023-11-12 02:12:46,354 INFO L226 Difference]: Without dead ends: 512 [2023-11-12 02:12:46,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2023-11-12 02:12:46,356 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 434 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:46,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1165 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-12 02:12:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2023-11-12 02:12:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 355. [2023-11-12 02:12:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 297 states have (on average 1.3265993265993266) internal successors, (394), 297 states have internal predecessors, (394), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-12 02:12:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 502 transitions. [2023-11-12 02:12:46,434 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 502 transitions. Word has length 139 [2023-11-12 02:12:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:46,434 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 502 transitions. [2023-11-12 02:12:46,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 10 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2023-11-12 02:12:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 502 transitions. [2023-11-12 02:12:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-12 02:12:46,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:46,437 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:46,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:12:46,437 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:46,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:46,438 INFO L85 PathProgramCache]: Analyzing trace with hash 543307321, now seen corresponding path program 1 times [2023-11-12 02:12:46,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:46,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128551661] [2023-11-12 02:12:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:46,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:12:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:12:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:12:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:12:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:12:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:12:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:12:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:12:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:12:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:12:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:12:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:12:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:12:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:12:51,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128551661] [2023-11-12 02:12:51,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128551661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:51,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:51,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-11-12 02:12:51,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762945385] [2023-11-12 02:12:51,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:51,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 02:12:51,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:51,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 02:12:51,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2023-11-12 02:12:51,888 INFO L87 Difference]: Start difference. First operand 355 states and 502 transitions. Second operand has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2023-11-12 02:12:57,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-12 02:13:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:00,279 INFO L93 Difference]: Finished difference Result 778 states and 1080 transitions. [2023-11-12 02:13:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-12 02:13:00,281 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 140 [2023-11-12 02:13:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:00,285 INFO L225 Difference]: With dead ends: 778 [2023-11-12 02:13:00,286 INFO L226 Difference]: Without dead ends: 649 [2023-11-12 02:13:00,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=363, Invalid=1197, Unknown=0, NotChecked=0, Total=1560 [2023-11-12 02:13:00,288 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 659 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:00,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1437 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2079 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2023-11-12 02:13:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-11-12 02:13:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 359. [2023-11-12 02:13:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 301 states have (on average 1.3289036544850499) internal successors, (400), 301 states have internal predecessors, (400), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-12 02:13:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 508 transitions. [2023-11-12 02:13:00,380 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 508 transitions. Word has length 140 [2023-11-12 02:13:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:00,381 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 508 transitions. [2023-11-12 02:13:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2023-11-12 02:13:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 508 transitions. [2023-11-12 02:13:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-12 02:13:00,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:00,384 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:00,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:13:00,384 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:13:00,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1871530343, now seen corresponding path program 1 times [2023-11-12 02:13:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:00,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281373228] [2023-11-12 02:13:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:00,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat