./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.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_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/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_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/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_15ac6bfb-1e96-4594-bbfd-307279e37f98/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 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:24:12,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:24:13,072 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:24:13,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:24:13,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:24:13,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:24:13,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:24:13,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:24:13,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:24:13,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:24:13,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:24:13,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:24:13,155 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:24:13,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:24:13,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:24:13,160 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:24:13,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:24:13,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:24:13,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:24:13,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:24:13,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:24:13,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:24:13,170 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:24:13,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:24:13,171 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:24:13,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:24:13,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:24:13,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:24:13,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:24:13,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:24:13,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:24:13,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:24:13,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:24:13,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:24:13,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:24:13,182 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:24:13,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:24:13,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:24:13,183 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:24:13,183 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_15ac6bfb-1e96-4594-bbfd-307279e37f98/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_15ac6bfb-1e96-4594-bbfd-307279e37f98/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 -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2023-11-12 02:24:13,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:24:13,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:24:13,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:24:13,511 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:24:13,512 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:24:13,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-12 02:24:16,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:24:17,045 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:24:17,046 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-12 02:24:17,057 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/data/db3ea6a62/b003804f18334d72a49f0c7f090d50e8/FLAGf4e4d3f55 [2023-11-12 02:24:17,073 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/data/db3ea6a62/b003804f18334d72a49f0c7f090d50e8 [2023-11-12 02:24:17,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:24:17,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:24:17,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:24:17,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:24:17,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:24:17,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e66d456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17, skipping insertion in model container [2023-11-12 02:24:17,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,148 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:24:17,317 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_15ac6bfb-1e96-4594-bbfd-307279e37f98/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-11-12 02:24:17,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:24:17,398 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:24:17,410 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_15ac6bfb-1e96-4594-bbfd-307279e37f98/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-11-12 02:24:17,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:24:17,469 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:24:17,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17 WrapperNode [2023-11-12 02:24:17,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:24:17,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:24:17,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:24:17,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:24:17,480 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:24:17" (1/1) ... [2023-11-12 02:24:17,493 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:24:17" (1/1) ... [2023-11-12 02:24:17,542 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2023-11-12 02:24:17,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:24:17,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:24:17,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:24:17,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:24:17,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:24:17,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:24:17,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:24:17,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:24:17,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (1/1) ... [2023-11-12 02:24:17,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:24:17,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:24:17,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/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:24:17,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/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:24:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:24:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:24:17,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:24:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:24:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:24:17,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:24:17,853 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:24:17,855 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:24:18,372 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:24:18,379 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:24:18,380 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:24:18,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:18 BoogieIcfgContainer [2023-11-12 02:24:18,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:24:18,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:24:18,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:24:18,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:24:18,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:24:17" (1/3) ... [2023-11-12 02:24:18,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7ee55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:24:18, skipping insertion in model container [2023-11-12 02:24:18,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:17" (2/3) ... [2023-11-12 02:24:18,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7ee55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:24:18, skipping insertion in model container [2023-11-12 02:24:18,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:18" (3/3) ... [2023-11-12 02:24:18,405 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-12 02:24:18,423 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:24:18,424 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:24:18,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:24:18,491 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;@5d89e3d5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:24:18,491 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:24:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:24:18,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:18,513 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:18,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:18,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1871924999, now seen corresponding path program 1 times [2023-11-12 02:24:18,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:18,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365004314] [2023-11-12 02:24:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:18,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:19,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365004314] [2023-11-12 02:24:19,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365004314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:19,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:19,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:24:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164536684] [2023-11-12 02:24:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:19,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:24:19,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:19,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:24:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:24:19,136 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:24:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:19,173 INFO L93 Difference]: Finished difference Result 135 states and 219 transitions. [2023-11-12 02:24:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:24:19,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2023-11-12 02:24:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:19,185 INFO L225 Difference]: With dead ends: 135 [2023-11-12 02:24:19,185 INFO L226 Difference]: Without dead ends: 65 [2023-11-12 02:24:19,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:24:19,197 INFO L413 NwaCegarLoop]: 100 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, 100 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:24:19,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-12 02:24:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-12 02:24:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2023-11-12 02:24:19,255 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 116 [2023-11-12 02:24:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:19,287 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2023-11-12 02:24:19,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:24:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2023-11-12 02:24:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:24:19,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:19,292 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:19,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:24:19,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:19,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:19,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1168316485, now seen corresponding path program 1 times [2023-11-12 02:24:19,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:19,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226315312] [2023-11-12 02:24:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226315312] [2023-11-12 02:24:19,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226315312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:19,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:24:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675911265] [2023-11-12 02:24:19,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:19,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:24:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:24:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:19,716 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:19,786 INFO L93 Difference]: Finished difference Result 154 states and 229 transitions. [2023-11-12 02:24:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:24:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-12 02:24:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:19,790 INFO L225 Difference]: With dead ends: 154 [2023-11-12 02:24:19,790 INFO L226 Difference]: Without dead ends: 92 [2023-11-12 02:24:19,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:19,793 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:19,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 192 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-12 02:24:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2023-11-12 02:24:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 113 transitions. [2023-11-12 02:24:19,810 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 113 transitions. Word has length 116 [2023-11-12 02:24:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:19,812 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 113 transitions. [2023-11-12 02:24:19,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 113 transitions. [2023-11-12 02:24:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:24:19,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:19,816 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:19,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:24:19,816 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:19,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash -455841797, now seen corresponding path program 1 times [2023-11-12 02:24:19,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:19,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61836914] [2023-11-12 02:24:19,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:19,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:20,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61836914] [2023-11-12 02:24:20,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61836914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:20,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:20,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:24:20,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703406636] [2023-11-12 02:24:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:20,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:24:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:20,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:24:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:24:20,799 INFO L87 Difference]: Start difference. First operand 76 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:21,386 INFO L93 Difference]: Finished difference Result 250 states and 373 transitions. [2023-11-12 02:24:21,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:24:21,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-12 02:24:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:21,391 INFO L225 Difference]: With dead ends: 250 [2023-11-12 02:24:21,391 INFO L226 Difference]: Without dead ends: 177 [2023-11-12 02:24:21,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:24:21,394 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 173 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:21,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 336 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:24:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-12 02:24:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2023-11-12 02:24:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 77 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2023-11-12 02:24:21,418 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 116 [2023-11-12 02:24:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:21,419 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2023-11-12 02:24:21,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2023-11-12 02:24:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:24:21,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:21,429 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:21,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:24:21,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:21,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1735705475, now seen corresponding path program 1 times [2023-11-12 02:24:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:21,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186069114] [2023-11-12 02:24:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186069114] [2023-11-12 02:24:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186069114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:21,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:24:22,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877465520] [2023-11-12 02:24:22,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:22,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:24:22,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:24:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:24:22,003 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:22,424 INFO L93 Difference]: Finished difference Result 248 states and 370 transitions. [2023-11-12 02:24:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:24:22,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-12 02:24:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:22,428 INFO L225 Difference]: With dead ends: 248 [2023-11-12 02:24:22,428 INFO L226 Difference]: Without dead ends: 156 [2023-11-12 02:24:22,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:24:22,431 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 83 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:22,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 547 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:24:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-12 02:24:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 107. [2023-11-12 02:24:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 160 transitions. [2023-11-12 02:24:22,446 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 160 transitions. Word has length 116 [2023-11-12 02:24:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:22,447 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 160 transitions. [2023-11-12 02:24:22,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 160 transitions. [2023-11-12 02:24:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:24:22,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:22,450 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:22,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:24:22,450 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:22,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash -116018576, now seen corresponding path program 1 times [2023-11-12 02:24:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:22,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341505628] [2023-11-12 02:24:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:22,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:23,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341505628] [2023-11-12 02:24:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341505628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:23,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:24:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172393256] [2023-11-12 02:24:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:23,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:24:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:24:23,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:24:23,122 INFO L87 Difference]: Start difference. First operand 107 states and 160 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:23,679 INFO L93 Difference]: Finished difference Result 282 states and 408 transitions. [2023-11-12 02:24:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:24:23,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-12 02:24:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:23,683 INFO L225 Difference]: With dead ends: 282 [2023-11-12 02:24:23,683 INFO L226 Difference]: Without dead ends: 178 [2023-11-12 02:24:23,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:24:23,685 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 99 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:23,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 456 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:24:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-12 02:24:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 112. [2023-11-12 02:24:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2023-11-12 02:24:23,713 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 117 [2023-11-12 02:24:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:23,714 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2023-11-12 02:24:23,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2023-11-12 02:24:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:24:23,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:23,720 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:23,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:24:23,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:23,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:23,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1082498701, now seen corresponding path program 1 times [2023-11-12 02:24:23,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:23,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949484824] [2023-11-12 02:24:23,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:23,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:23,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949484824] [2023-11-12 02:24:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949484824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:23,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:23,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:24:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363444620] [2023-11-12 02:24:23,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:23,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:24:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:23,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:24:23,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:23,933 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:24,007 INFO L93 Difference]: Finished difference Result 275 states and 391 transitions. [2023-11-12 02:24:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:24:24,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-12 02:24:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:24,010 INFO L225 Difference]: With dead ends: 275 [2023-11-12 02:24:24,011 INFO L226 Difference]: Without dead ends: 166 [2023-11-12 02:24:24,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:24,015 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:24,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 190 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-12 02:24:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 105. [2023-11-12 02:24:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2023-11-12 02:24:24,043 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 117 [2023-11-12 02:24:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:24,044 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2023-11-12 02:24:24,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2023-11-12 02:24:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:24:24,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:24,046 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:24,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:24:24,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:24,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:24,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1713542211, now seen corresponding path program 1 times [2023-11-12 02:24:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:24,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712292598] [2023-11-12 02:24:24,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:24,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:24,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712292598] [2023-11-12 02:24:24,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712292598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:24,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:24,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:24:24,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681780003] [2023-11-12 02:24:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:24,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:24:24,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:24,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:24:24,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:24:24,589 INFO L87 Difference]: Start difference. First operand 105 states and 149 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:25,098 INFO L93 Difference]: Finished difference Result 273 states and 376 transitions. [2023-11-12 02:24:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:24:25,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:24:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:25,102 INFO L225 Difference]: With dead ends: 273 [2023-11-12 02:24:25,102 INFO L226 Difference]: Without dead ends: 171 [2023-11-12 02:24:25,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:24:25,104 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 86 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:25,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 583 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:24:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-12 02:24:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 103. [2023-11-12 02:24:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2023-11-12 02:24:25,120 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 118 [2023-11-12 02:24:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:25,121 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2023-11-12 02:24:25,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2023-11-12 02:24:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:24:25,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:25,124 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:25,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:24:25,124 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:25,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1727388030, now seen corresponding path program 1 times [2023-11-12 02:24:25,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103788179] [2023-11-12 02:24:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:25,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:25,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103788179] [2023-11-12 02:24:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103788179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:25,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:25,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:24:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440433136] [2023-11-12 02:24:25,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:25,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:24:25,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:25,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:24:25,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:24:25,646 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:26,100 INFO L93 Difference]: Finished difference Result 303 states and 429 transitions. [2023-11-12 02:24:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:24:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:24:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:26,103 INFO L225 Difference]: With dead ends: 303 [2023-11-12 02:24:26,103 INFO L226 Difference]: Without dead ends: 203 [2023-11-12 02:24:26,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:24:26,104 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 170 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:26,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 573 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:24:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-12 02:24:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2023-11-12 02:24:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 95 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 160 transitions. [2023-11-12 02:24:26,119 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 160 transitions. Word has length 118 [2023-11-12 02:24:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:26,120 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 160 transitions. [2023-11-12 02:24:26,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 160 transitions. [2023-11-12 02:24:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:24:26,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:26,122 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:26,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:24:26,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:26,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 47619332, now seen corresponding path program 1 times [2023-11-12 02:24:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438492288] [2023-11-12 02:24:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:26,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438492288] [2023-11-12 02:24:26,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438492288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:26,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:26,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:24:26,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328537145] [2023-11-12 02:24:26,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:26,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:24:26,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:26,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:24:26,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:26,246 INFO L87 Difference]: Start difference. First operand 113 states and 160 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:26,292 INFO L93 Difference]: Finished difference Result 286 states and 401 transitions. [2023-11-12 02:24:26,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:24:26,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:24:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:26,295 INFO L225 Difference]: With dead ends: 286 [2023-11-12 02:24:26,295 INFO L226 Difference]: Without dead ends: 176 [2023-11-12 02:24:26,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:26,296 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 75 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:26,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 244 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-12 02:24:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 123. [2023-11-12 02:24:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2023-11-12 02:24:26,305 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 118 [2023-11-12 02:24:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:26,305 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2023-11-12 02:24:26,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2023-11-12 02:24:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:24:26,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:26,308 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:26,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:24:26,308 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:26,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1980773252, now seen corresponding path program 1 times [2023-11-12 02:24:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:26,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916829610] [2023-11-12 02:24:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:26,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:26,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916829610] [2023-11-12 02:24:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916829610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:26,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:26,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:24:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369973972] [2023-11-12 02:24:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:26,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:24:26,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:26,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:24:26,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:26,443 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:26,489 INFO L93 Difference]: Finished difference Result 322 states and 446 transitions. [2023-11-12 02:24:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:24:26,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:24:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:26,492 INFO L225 Difference]: With dead ends: 322 [2023-11-12 02:24:26,492 INFO L226 Difference]: Without dead ends: 202 [2023-11-12 02:24:26,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:26,493 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 79 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:26,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 187 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-12 02:24:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 141. [2023-11-12 02:24:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 123 states have internal predecessors, (162), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 194 transitions. [2023-11-12 02:24:26,502 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 194 transitions. Word has length 118 [2023-11-12 02:24:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:26,503 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 194 transitions. [2023-11-12 02:24:26,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 194 transitions. [2023-11-12 02:24:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:24:26,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:26,505 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:26,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:24:26,506 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:26,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:26,506 INFO L85 PathProgramCache]: Analyzing trace with hash -539186682, now seen corresponding path program 1 times [2023-11-12 02:24:26,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492959853] [2023-11-12 02:24:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:26,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492959853] [2023-11-12 02:24:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492959853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:26,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:24:26,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920900439] [2023-11-12 02:24:26,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:26,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:24:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:24:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:24:26,821 INFO L87 Difference]: Start difference. First operand 141 states and 194 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:27,024 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2023-11-12 02:24:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:24:27,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:24:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:27,029 INFO L225 Difference]: With dead ends: 332 [2023-11-12 02:24:27,029 INFO L226 Difference]: Without dead ends: 194 [2023-11-12 02:24:27,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:24:27,031 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 171 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:27,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 182 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:24:27,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-12 02:24:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 141. [2023-11-12 02:24:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 123 states have internal predecessors, (160), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2023-11-12 02:24:27,050 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 118 [2023-11-12 02:24:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:27,050 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2023-11-12 02:24:27,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2023-11-12 02:24:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:24:27,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:27,053 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:27,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:24:27,053 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:27,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash 288538153, now seen corresponding path program 1 times [2023-11-12 02:24:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301673685] [2023-11-12 02:24:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301673685] [2023-11-12 02:24:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301673685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:27,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:27,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:24:27,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452438826] [2023-11-12 02:24:27,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:27,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:24:27,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:27,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:24:27,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:27,208 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:27,290 INFO L93 Difference]: Finished difference Result 323 states and 441 transitions. [2023-11-12 02:24:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:24:27,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:24:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:27,292 INFO L225 Difference]: With dead ends: 323 [2023-11-12 02:24:27,293 INFO L226 Difference]: Without dead ends: 185 [2023-11-12 02:24:27,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:27,294 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:27,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 223 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-12 02:24:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2023-11-12 02:24:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.2815533980582525) internal successors, (132), 103 states have internal predecessors, (132), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions. [2023-11-12 02:24:27,322 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 118 [2023-11-12 02:24:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:27,323 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 164 transitions. [2023-11-12 02:24:27,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2023-11-12 02:24:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:24:27,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:27,325 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:27,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:24:27,325 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:27,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1197972584, now seen corresponding path program 1 times [2023-11-12 02:24:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:27,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044417847] [2023-11-12 02:24:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:27,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044417847] [2023-11-12 02:24:27,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044417847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:27,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:27,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:24:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617394037] [2023-11-12 02:24:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:27,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:24:27,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:27,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:24:27,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:27,453 INFO L87 Difference]: Start difference. First operand 121 states and 164 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:27,537 INFO L93 Difference]: Finished difference Result 312 states and 421 transitions. [2023-11-12 02:24:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:24:27,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:24:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:27,540 INFO L225 Difference]: With dead ends: 312 [2023-11-12 02:24:27,540 INFO L226 Difference]: Without dead ends: 194 [2023-11-12 02:24:27,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:27,542 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 81 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:27,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 171 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-12 02:24:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2023-11-12 02:24:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.265625) internal successors, (162), 128 states have internal predecessors, (162), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2023-11-12 02:24:27,590 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 118 [2023-11-12 02:24:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:27,591 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2023-11-12 02:24:27,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2023-11-12 02:24:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:24:27,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:27,594 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:27,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:24:27,594 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:27,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1140714282, now seen corresponding path program 1 times [2023-11-12 02:24:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170566998] [2023-11-12 02:24:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:24:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:24:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:24:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:24:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:24:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:24:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:24:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:28,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:28,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170566998] [2023-11-12 02:24:28,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170566998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:28,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:28,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:24:28,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223016557] [2023-11-12 02:24:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:28,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:24:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:24:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:24:28,201 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:28,448 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2023-11-12 02:24:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:24:28,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:24:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:28,451 INFO L225 Difference]: With dead ends: 433 [2023-11-12 02:24:28,452 INFO L226 Difference]: Without dead ends: 290 [2023-11-12 02:24:28,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:24:28,453 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 110 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:28,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 316 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:24:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-11-12 02:24:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 180. [2023-11-12 02:24:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 145 states have internal predecessors, (179), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:24:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 243 transitions. [2023-11-12 02:24:28,513 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 243 transitions. Word has length 118 [2023-11-12 02:24:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:28,514 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 243 transitions. [2023-11-12 02:24:28,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 243 transitions. [2023-11-12 02:24:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:24:28,516 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:28,516 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:28,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:24:28,517 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:28,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash -921859564, now seen corresponding path program 1 times [2023-11-12 02:24:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:28,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685703392] [2023-11-12 02:24:28,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:28,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:24:28,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:24:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:24:28,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:24:28,758 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:24:28,759 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:24:28,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:24:28,766 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:28,770 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:24:28,886 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-12 02:24:28,887 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-12 02:24:28,888 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-12 02:24:28,888 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-12 02:24:28,889 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-12 02:24:28,889 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-12 02:24:28,889 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-12 02:24:28,889 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-12 02:24:28,889 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-12 02:24:28,889 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-12 02:24:28,890 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-12 02:24:28,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:24:28 BoogieIcfgContainer [2023-11-12 02:24:28,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:24:28,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:24:28,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:24:28,921 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:24:28,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:18" (3/4) ... [2023-11-12 02:24:28,924 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:24:28,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:24:28,926 INFO L158 Benchmark]: Toolchain (without parser) took 11840.77ms. Allocated memory was 123.7MB in the beginning and 184.5MB in the end (delta: 60.8MB). Free memory was 79.0MB in the beginning and 54.8MB in the end (delta: 24.2MB). Peak memory consumption was 87.1MB. Max. memory is 16.1GB. [2023-11-12 02:24:28,926 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 123.7MB. Free memory was 87.4MB in the beginning and 87.3MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:24:28,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.05ms. Allocated memory is still 123.7MB. Free memory was 79.0MB in the beginning and 64.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:24:28,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.64ms. Allocated memory is still 123.7MB. Free memory was 64.8MB in the beginning and 61.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:24:28,928 INFO L158 Benchmark]: Boogie Preprocessor took 52.37ms. Allocated memory is still 123.7MB. Free memory was 61.0MB in the beginning and 59.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:24:28,929 INFO L158 Benchmark]: RCFGBuilder took 786.00ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 59.2MB in the beginning and 109.2MB in the end (delta: -50.0MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2023-11-12 02:24:28,930 INFO L158 Benchmark]: TraceAbstraction took 10528.78ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 108.5MB in the beginning and 54.8MB in the end (delta: 53.7MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2023-11-12 02:24:28,931 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 184.5MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:24:28,933 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63ms. Allocated memory is still 123.7MB. Free memory was 87.4MB in the beginning and 87.3MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.05ms. Allocated memory is still 123.7MB. Free memory was 79.0MB in the beginning and 64.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.64ms. Allocated memory is still 123.7MB. Free memory was 64.8MB in the beginning and 61.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.37ms. Allocated memory is still 123.7MB. Free memory was 61.0MB in the beginning and 59.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 786.00ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 59.2MB in the beginning and 109.2MB in the end (delta: -50.0MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10528.78ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 108.5MB in the beginning and 54.8MB in the end (delta: 53.7MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 184.5MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of shiftRight at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] int k_loop; [L131] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] COND TRUE k_loop < 1 [L132] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L133] RET updateVariables() [L134] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L134] RET step() [L135] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 15, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1299 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1299 mSDsluCounter, 4300 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2522 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1223 IncrementalHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 1778 mSDtfsCounter, 1223 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 497 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=14, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 821 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1760 NumberOfCodeBlocks, 1760 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1628 ConstructedInterpolants, 0 QuantifiedInterpolants, 3851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6720/6720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-12 02:24:28,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/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_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/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 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:24:31,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:24:31,727 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-12 02:24:31,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:24:31,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:24:31,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:24:31,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:24:31,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:24:31,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:24:31,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:24:31,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:24:31,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:24:31,778 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:24:31,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:24:31,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:24:31,780 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:24:31,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:24:31,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:24:31,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:24:31,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:24:31,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:24:31,784 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:24:31,784 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:24:31,785 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:24:31,785 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:24:31,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:24:31,786 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:24:31,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:24:31,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:24:31,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:24:31,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:24:31,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:24:31,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:24:31,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:24:31,790 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:24:31,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:24:31,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:24:31,791 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:24:31,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:24:31,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:24:31,792 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:24:31,793 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:24:31,793 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_15ac6bfb-1e96-4594-bbfd-307279e37f98/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_15ac6bfb-1e96-4594-bbfd-307279e37f98/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 -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2023-11-12 02:24:32,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:24:32,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:24:32,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:24:32,191 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:24:32,192 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:24:32,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-12 02:24:35,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:24:35,862 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:24:35,863 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-12 02:24:35,877 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/data/286a2abb8/2bcf2a60e61947798773f881305bdd23/FLAG5801839a8 [2023-11-12 02:24:35,898 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/data/286a2abb8/2bcf2a60e61947798773f881305bdd23 [2023-11-12 02:24:35,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:24:35,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:24:35,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:24:35,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:24:35,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:24:35,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:35" (1/1) ... [2023-11-12 02:24:35,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af443a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:35, skipping insertion in model container [2023-11-12 02:24:35,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:35" (1/1) ... [2023-11-12 02:24:35,968 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:24:36,168 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_15ac6bfb-1e96-4594-bbfd-307279e37f98/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-11-12 02:24:36,302 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:24:36,321 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:24:36,341 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_15ac6bfb-1e96-4594-bbfd-307279e37f98/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-11-12 02:24:36,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:24:36,438 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:24:36,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36 WrapperNode [2023-11-12 02:24:36,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:24:36,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:24:36,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:24:36,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:24:36,451 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:24:36" (1/1) ... [2023-11-12 02:24:36,483 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:24:36" (1/1) ... [2023-11-12 02:24:36,547 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2023-11-12 02:24:36,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:24:36,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:24:36,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:24:36,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:24:36,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (1/1) ... [2023-11-12 02:24:36,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (1/1) ... [2023-11-12 02:24:36,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (1/1) ... [2023-11-12 02:24:36,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (1/1) ... [2023-11-12 02:24:36,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (1/1) ... [2023-11-12 02:24:36,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (1/1) ... [2023-11-12 02:24:36,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (1/1) ... [2023-11-12 02:24:36,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (1/1) ... [2023-11-12 02:24:36,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:24:36,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:24:36,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:24:36,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:24:36,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (1/1) ... [2023-11-12 02:24:36,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:24:36,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:24:36,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/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:24:36,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/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:24:36,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:24:36,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:24:36,720 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:24:36,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:24:36,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:24:36,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:24:36,863 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:24:36,868 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:24:41,505 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:24:41,512 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:24:41,513 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:24:41,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:41 BoogieIcfgContainer [2023-11-12 02:24:41,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:24:41,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:24:41,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:24:41,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:24:41,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:24:35" (1/3) ... [2023-11-12 02:24:41,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2708dd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:24:41, skipping insertion in model container [2023-11-12 02:24:41,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:36" (2/3) ... [2023-11-12 02:24:41,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2708dd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:24:41, skipping insertion in model container [2023-11-12 02:24:41,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:41" (3/3) ... [2023-11-12 02:24:41,526 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-12 02:24:41,544 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:24:41,544 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:24:41,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:24:41,606 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;@4648f515, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:24:41,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:24:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-12 02:24:41,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:41,627 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:41,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:41,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:41,634 INFO L85 PathProgramCache]: Analyzing trace with hash -94440497, now seen corresponding path program 1 times [2023-11-12 02:24:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:24:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036326822] [2023-11-12 02:24:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:41,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:24:41,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:24:41,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:24:41,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-12 02:24:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:42,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:24:42,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:24:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2023-11-12 02:24:42,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:24:42,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:24:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036326822] [2023-11-12 02:24:42,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036326822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:42,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:42,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:24:42,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294606233] [2023-11-12 02:24:42,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:42,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:24:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:24:42,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:24:42,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:24:42,536 INFO L87 Difference]: Start difference. First operand has 59 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:24:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:42,584 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2023-11-12 02:24:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:24:42,587 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2023-11-12 02:24:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:42,597 INFO L225 Difference]: With dead ends: 115 [2023-11-12 02:24:42,597 INFO L226 Difference]: Without dead ends: 55 [2023-11-12 02:24:42,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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:24:42,606 INFO L413 NwaCegarLoop]: 83 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, 83 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:24:42,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-12 02:24:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-12 02:24:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:24:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2023-11-12 02:24:42,667 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 110 [2023-11-12 02:24:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:42,667 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2023-11-12 02:24:42,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:24:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2023-11-12 02:24:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-12 02:24:42,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:42,674 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:42,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:24:42,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:24:42,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:42,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash 530981763, now seen corresponding path program 1 times [2023-11-12 02:24:42,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:24:42,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052420781] [2023-11-12 02:24:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:42,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:24:42,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:24:42,882 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:24:42,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-12 02:24:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:43,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:24:43,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:24:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:44,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:24:44,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:24:44,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052420781] [2023-11-12 02:24:44,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052420781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:44,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:44,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:24:44,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788618084] [2023-11-12 02:24:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:44,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:24:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:24:44,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:24:44,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:24:44,680 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:47,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:24:49,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:24:50,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:24:53,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:24:55,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:24:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:55,066 INFO L93 Difference]: Finished difference Result 160 states and 232 transitions. [2023-11-12 02:24:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:24:55,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2023-11-12 02:24:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:55,094 INFO L225 Difference]: With dead ends: 160 [2023-11-12 02:24:55,094 INFO L226 Difference]: Without dead ends: 108 [2023-11-12 02:24:55,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:24:55,097 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 78 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 33 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:55,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 251 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 56 Invalid, 4 Unknown, 0 Unchecked, 10.3s Time] [2023-11-12 02:24:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-12 02:24:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-11-12 02:24:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:24:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-11-12 02:24:55,128 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 110 [2023-11-12 02:24:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:55,129 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-11-12 02:24:55,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-11-12 02:24:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-12 02:24:55,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:55,132 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:55,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:24:55,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:24:55,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:55,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash -480135487, now seen corresponding path program 1 times [2023-11-12 02:24:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:24:55,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660819034] [2023-11-12 02:24:55,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:24:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:24:55,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:24:55,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-12 02:24:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:55,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:24:55,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:24:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:24:55,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:24:55,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:24:55,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660819034] [2023-11-12 02:24:55,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660819034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:24:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55242578] [2023-11-12 02:24:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:55,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:24:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:24:55,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:24:55,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:55,899 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:58,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:24:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:59,215 INFO L93 Difference]: Finished difference Result 158 states and 227 transitions. [2023-11-12 02:24:59,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:24:59,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2023-11-12 02:24:59,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:59,219 INFO L225 Difference]: With dead ends: 158 [2023-11-12 02:24:59,219 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 02:24:59,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:24:59,222 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 15 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:59,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2023-11-12 02:24:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 02:24:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2023-11-12 02:24:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:24:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2023-11-12 02:24:59,246 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 110 [2023-11-12 02:24:59,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:59,247 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2023-11-12 02:24:59,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:24:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2023-11-12 02:24:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-12 02:24:59,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:59,251 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:59,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:24:59,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:24:59,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:59,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:59,472 INFO L85 PathProgramCache]: Analyzing trace with hash 479094529, now seen corresponding path program 1 times [2023-11-12 02:24:59,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:24:59,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215580962] [2023-11-12 02:24:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:24:59,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:24:59,474 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:24:59,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ac6bfb-1e96-4594-bbfd-307279e37f98/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-12 02:24:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:59,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-12 02:24:59,953 INFO L285 TraceCheckSpWp]: Computing forward predicates...