./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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_4ab6ce41-01e5-4524-a90d-4aebc920170f/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 fccf2d2c93d03d1017d49983a9fd698a073845527500499b9c3f790f8d57593b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:34:13,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:34:14,066 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:34:14,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:34:14,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:34:14,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:34:14,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:34:14,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:34:14,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:34:14,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:34:14,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:34:14,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:34:14,126 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:34:14,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:34:14,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:34:14,129 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:34:14,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:34:14,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:34:14,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:34:14,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:34:14,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:34:14,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:34:14,133 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:34:14,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:34:14,134 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:34:14,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:34:14,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:34:14,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:34:14,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:34:14,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:34:14,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:34:14,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:34:14,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:34:14,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:34:14,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:34:14,140 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:34:14,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:34:14,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:34:14,141 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:34:14,141 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_4ab6ce41-01e5-4524-a90d-4aebc920170f/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_4ab6ce41-01e5-4524-a90d-4aebc920170f/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 -> fccf2d2c93d03d1017d49983a9fd698a073845527500499b9c3f790f8d57593b [2023-11-12 02:34:14,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:34:14,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:34:14,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:34:14,533 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:34:14,534 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:34:14,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i [2023-11-12 02:34:17,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:34:18,064 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:34:18,065 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i [2023-11-12 02:34:18,078 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/data/f67f111d9/c7eba39aaca24459afe3aefcb94d4b5a/FLAG04fc365e9 [2023-11-12 02:34:18,100 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/data/f67f111d9/c7eba39aaca24459afe3aefcb94d4b5a [2023-11-12 02:34:18,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:34:18,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:34:18,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:34:18,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:34:18,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:34:18,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5bf442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18, skipping insertion in model container [2023-11-12 02:34:18,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,161 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:34:18,358 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_4ab6ce41-01e5-4524-a90d-4aebc920170f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i[915,928] [2023-11-12 02:34:18,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:34:18,412 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:34:18,424 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_4ab6ce41-01e5-4524-a90d-4aebc920170f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i[915,928] [2023-11-12 02:34:18,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:34:18,461 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:34:18,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18 WrapperNode [2023-11-12 02:34:18,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:34:18,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:34:18,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:34:18,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:34:18,471 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:34:18" (1/1) ... [2023-11-12 02:34:18,481 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:34:18" (1/1) ... [2023-11-12 02:34:18,509 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2023-11-12 02:34:18,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:34:18,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:34:18,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:34:18,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:34:18,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:34:18,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:34:18,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:34:18,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:34:18,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (1/1) ... [2023-11-12 02:34:18,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:34:18,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:34:18,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:18,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:34:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:34:18,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:34:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:34:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:34:18,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:34:18,757 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:34:18,760 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:34:19,196 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:34:19,207 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:34:19,210 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:34:19,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:34:19 BoogieIcfgContainer [2023-11-12 02:34:19,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:34:19,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:34:19,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:34:19,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:34:19,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:34:18" (1/3) ... [2023-11-12 02:34:19,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@885c998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:34:19, skipping insertion in model container [2023-11-12 02:34:19,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:18" (2/3) ... [2023-11-12 02:34:19,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@885c998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:34:19, skipping insertion in model container [2023-11-12 02:34:19,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:34:19" (3/3) ... [2023-11-12 02:34:19,227 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-81.i [2023-11-12 02:34:19,249 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:34:19,250 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:34:19,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:34:19,320 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;@740ff481, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:34:19,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:34:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 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:34:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-12 02:34:19,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:19,376 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] [2023-11-12 02:34:19,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:19,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash 542925653, now seen corresponding path program 1 times [2023-11-12 02:34:19,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:19,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912928998] [2023-11-12 02:34:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:19,920 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:34:19,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:19,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912928998] [2023-11-12 02:34:19,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912928998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:19,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:19,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:34:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38026724] [2023-11-12 02:34:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:19,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:34:19,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:19,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:34:19,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:34:19,985 INFO L87 Difference]: Start difference. First operand has 63 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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:34:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:20,034 INFO L93 Difference]: Finished difference Result 119 states and 200 transitions. [2023-11-12 02:34:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:34:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 108 [2023-11-12 02:34:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:20,047 INFO L225 Difference]: With dead ends: 119 [2023-11-12 02:34:20,048 INFO L226 Difference]: Without dead ends: 59 [2023-11-12 02:34:20,054 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:34:20,058 INFO L413 NwaCegarLoop]: 86 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, 86 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:34:20,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:34:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-12 02:34:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-12 02:34:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3170731707317074) 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:34:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2023-11-12 02:34:20,116 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 108 [2023-11-12 02:34:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:20,117 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2023-11-12 02:34:20,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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:34:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2023-11-12 02:34:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-12 02:34:20,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:20,121 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] [2023-11-12 02:34:20,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:34:20,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:20,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash -322909363, now seen corresponding path program 1 times [2023-11-12 02:34:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497862120] [2023-11-12 02:34:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,195 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:34:21,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:21,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497862120] [2023-11-12 02:34:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497862120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:21,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:21,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:34:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653832924] [2023-11-12 02:34:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:21,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:21,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:21,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:21,208 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:34:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:21,621 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2023-11-12 02:34:21,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:34:21,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 108 [2023-11-12 02:34:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:21,627 INFO L225 Difference]: With dead ends: 163 [2023-11-12 02:34:21,627 INFO L226 Difference]: Without dead ends: 107 [2023-11-12 02:34:21,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:34:21,630 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 70 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:21,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 345 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:34:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-12 02:34:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2023-11-12 02:34:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.337837837837838) internal successors, (99), 75 states have internal predecessors, (99), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-12 02:34:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2023-11-12 02:34:21,657 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 108 [2023-11-12 02:34:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:21,658 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2023-11-12 02:34:21,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:34:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2023-11-12 02:34:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-12 02:34:21,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:21,661 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] [2023-11-12 02:34:21,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:34:21,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:21,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash -909715377, now seen corresponding path program 1 times [2023-11-12 02:34:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:21,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882540616] [2023-11-12 02:34:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:21,962 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:34:21,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:21,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882540616] [2023-11-12 02:34:21,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882540616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:21,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:21,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:34:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471264122] [2023-11-12 02:34:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:21,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:34:21,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:21,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:34:21,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:34:21,970 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:34:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:22,058 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2023-11-12 02:34:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:34:22,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 108 [2023-11-12 02:34:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:22,068 INFO L225 Difference]: With dead ends: 207 [2023-11-12 02:34:22,069 INFO L226 Difference]: Without dead ends: 109 [2023-11-12 02:34:22,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:34:22,080 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 5 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:22,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 213 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:34:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-12 02:34:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-11-12 02:34:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 77 states have internal predecessors, (101), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-12 02:34:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2023-11-12 02:34:22,122 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 108 [2023-11-12 02:34:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:22,123 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2023-11-12 02:34:22,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:34:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2023-11-12 02:34:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-12 02:34:22,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:22,131 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] [2023-11-12 02:34:22,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:34:22,132 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:22,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1762256139, now seen corresponding path program 1 times [2023-11-12 02:34:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:22,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964297710] [2023-11-12 02:34:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:22,357 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:34:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964297710] [2023-11-12 02:34:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964297710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:22,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:22,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:34:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548698993] [2023-11-12 02:34:22,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:22,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:22,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:22,361 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:34:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:22,593 INFO L93 Difference]: Finished difference Result 275 states and 398 transitions. [2023-11-12 02:34:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:34:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 109 [2023-11-12 02:34:22,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:22,600 INFO L225 Difference]: With dead ends: 275 [2023-11-12 02:34:22,600 INFO L226 Difference]: Without dead ends: 175 [2023-11-12 02:34:22,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:34:22,612 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 109 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:22,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 312 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:34:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-12 02:34:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2023-11-12 02:34:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 116 states have internal predecessors, (152), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-12 02:34:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 232 transitions. [2023-11-12 02:34:22,662 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 232 transitions. Word has length 109 [2023-11-12 02:34:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:22,663 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 232 transitions. [2023-11-12 02:34:22,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:34:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 232 transitions. [2023-11-12 02:34:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-12 02:34:22,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:22,665 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] [2023-11-12 02:34:22,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:34:22,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:22,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash 751138889, now seen corresponding path program 1 times [2023-11-12 02:34:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:22,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085112124] [2023-11-12 02:34:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-12 02:34:23,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085112124] [2023-11-12 02:34:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085112124] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:34:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766192513] [2023-11-12 02:34:23,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:23,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:34:23,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:34:23,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:34:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:23,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:34:23,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:34:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-11-12 02:34:23,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:34:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-12 02:34:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766192513] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:34:23,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:34:23,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-12 02:34:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037321107] [2023-11-12 02:34:23,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:34:23,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:34:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:34:23,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:34:23,637 INFO L87 Difference]: Start difference. First operand 159 states and 232 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-12 02:34:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:24,231 INFO L93 Difference]: Finished difference Result 587 states and 835 transitions. [2023-11-12 02:34:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-12 02:34:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 109 [2023-11-12 02:34:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:24,236 INFO L225 Difference]: With dead ends: 587 [2023-11-12 02:34:24,236 INFO L226 Difference]: Without dead ends: 431 [2023-11-12 02:34:24,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2023-11-12 02:34:24,238 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 274 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:24,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 252 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:34:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-11-12 02:34:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 401. [2023-11-12 02:34:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 293 states have (on average 1.2696245733788396) internal successors, (372), 298 states have internal predecessors, (372), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-12 02:34:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 564 transitions. [2023-11-12 02:34:24,335 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 564 transitions. Word has length 109 [2023-11-12 02:34:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:24,336 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 564 transitions. [2023-11-12 02:34:24,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-12 02:34:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 564 transitions. [2023-11-12 02:34:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-12 02:34:24,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:24,339 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] [2023-11-12 02:34:24,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:34:24,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:24,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:24,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1716799625, now seen corresponding path program 1 times [2023-11-12 02:34:24,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:24,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636828236] [2023-11-12 02:34:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:24,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:24,699 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:34:24,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:24,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636828236] [2023-11-12 02:34:24,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636828236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:24,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:24,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:34:24,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616856165] [2023-11-12 02:34:24,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:24,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:34:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:24,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:34:24,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:34:24,702 INFO L87 Difference]: Start difference. First operand 401 states and 564 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:34:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:24,807 INFO L93 Difference]: Finished difference Result 805 states and 1132 transitions. [2023-11-12 02:34:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:34:24,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 109 [2023-11-12 02:34:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:24,813 INFO L225 Difference]: With dead ends: 805 [2023-11-12 02:34:24,814 INFO L226 Difference]: Without dead ends: 407 [2023-11-12 02:34:24,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:24,816 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 88 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:24,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 246 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:34:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-12 02:34:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 401. [2023-11-12 02:34:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 293 states have (on average 1.2491467576791808) internal successors, (366), 298 states have internal predecessors, (366), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-12 02:34:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 558 transitions. [2023-11-12 02:34:24,931 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 558 transitions. Word has length 109 [2023-11-12 02:34:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:24,932 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 558 transitions. [2023-11-12 02:34:24,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:34:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 558 transitions. [2023-11-12 02:34:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-12 02:34:24,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:24,934 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] [2023-11-12 02:34:24,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:34:24,934 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:24,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash 373281828, now seen corresponding path program 1 times [2023-11-12 02:34:24,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:24,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526544479] [2023-11-12 02:34:24,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:28,748 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:34:28,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526544479] [2023-11-12 02:34:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526544479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:28,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:28,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-12 02:34:28,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474397471] [2023-11-12 02:34:28,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:28,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 02:34:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:28,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 02:34:28,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:34:28,752 INFO L87 Difference]: Start difference. First operand 401 states and 558 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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:34:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:31,656 INFO L93 Difference]: Finished difference Result 1040 states and 1418 transitions. [2023-11-12 02:34:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-12 02:34:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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 111 [2023-11-12 02:34:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:31,665 INFO L225 Difference]: With dead ends: 1040 [2023-11-12 02:34:31,666 INFO L226 Difference]: Without dead ends: 642 [2023-11-12 02:34:31,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=438, Invalid=1368, Unknown=0, NotChecked=0, Total=1806 [2023-11-12 02:34:31,669 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 319 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:31,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 686 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-12 02:34:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2023-11-12 02:34:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 434. [2023-11-12 02:34:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 318 states have (on average 1.2358490566037736) internal successors, (393), 324 states have internal predecessors, (393), 102 states have call successors, (102), 13 states have call predecessors, (102), 13 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2023-11-12 02:34:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2023-11-12 02:34:31,743 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 111 [2023-11-12 02:34:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:31,743 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2023-11-12 02:34:31,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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:34:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2023-11-12 02:34:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-12 02:34:31,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:31,746 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] [2023-11-12 02:34:31,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:34:31,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:31,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:31,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1514887598, now seen corresponding path program 1 times [2023-11-12 02:34:31,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:31,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030537602] [2023-11-12 02:34:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,044 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:34:32,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:32,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030537602] [2023-11-12 02:34:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030537602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:32,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:32,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:34:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708273301] [2023-11-12 02:34:32,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:32,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:34:32,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:32,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:34:32,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:34:32,047 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:34:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:32,387 INFO L93 Difference]: Finished difference Result 1193 states and 1640 transitions. [2023-11-12 02:34:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:34:32,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 111 [2023-11-12 02:34:32,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:32,395 INFO L225 Difference]: With dead ends: 1193 [2023-11-12 02:34:32,395 INFO L226 Difference]: Without dead ends: 774 [2023-11-12 02:34:32,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:32,398 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 90 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:32,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 282 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:34:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2023-11-12 02:34:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 533. [2023-11-12 02:34:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 403 states have (on average 1.205955334987593) internal successors, (486), 410 states have internal predecessors, (486), 114 states have call successors, (114), 15 states have call predecessors, (114), 15 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-12 02:34:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 714 transitions. [2023-11-12 02:34:32,506 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 714 transitions. Word has length 111 [2023-11-12 02:34:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:32,506 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 714 transitions. [2023-11-12 02:34:32,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:34:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 714 transitions. [2023-11-12 02:34:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-12 02:34:32,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:32,509 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] [2023-11-12 02:34:32,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:34:32,509 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:32,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1110119143, now seen corresponding path program 1 times [2023-11-12 02:34:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407010430] [2023-11-12 02:34:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:32,597 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:34:32,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:32,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407010430] [2023-11-12 02:34:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407010430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:32,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:32,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:34:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346039303] [2023-11-12 02:34:32,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:32,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:34:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:32,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:34:32,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:34:32,600 INFO L87 Difference]: Start difference. First operand 533 states and 714 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:34:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:32,813 INFO L93 Difference]: Finished difference Result 1350 states and 1810 transitions. [2023-11-12 02:34:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:34:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 112 [2023-11-12 02:34:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:32,822 INFO L225 Difference]: With dead ends: 1350 [2023-11-12 02:34:32,822 INFO L226 Difference]: Without dead ends: 832 [2023-11-12 02:34:32,824 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:34:32,827 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 64 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:32,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:34:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-11-12 02:34:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 513. [2023-11-12 02:34:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 383 states have (on average 1.1618798955613576) internal successors, (445), 390 states have internal predecessors, (445), 114 states have call successors, (114), 15 states have call predecessors, (114), 15 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-12 02:34:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 673 transitions. [2023-11-12 02:34:32,979 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 673 transitions. Word has length 112 [2023-11-12 02:34:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:32,980 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 673 transitions. [2023-11-12 02:34:32,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:34:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 673 transitions. [2023-11-12 02:34:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-12 02:34:32,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:32,982 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] [2023-11-12 02:34:32,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:34:32,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:32,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1302362273, now seen corresponding path program 1 times [2023-11-12 02:34:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:32,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186797433] [2023-11-12 02:34:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:32,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:33,166 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:34:33,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:33,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186797433] [2023-11-12 02:34:33,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186797433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:33,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:33,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:34:33,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090094868] [2023-11-12 02:34:33,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:33,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:33,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:33,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:33,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:33,169 INFO L87 Difference]: Start difference. First operand 513 states and 673 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:34:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:33,471 INFO L93 Difference]: Finished difference Result 1097 states and 1455 transitions. [2023-11-12 02:34:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:34:33,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 112 [2023-11-12 02:34:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:33,478 INFO L225 Difference]: With dead ends: 1097 [2023-11-12 02:34:33,479 INFO L226 Difference]: Without dead ends: 777 [2023-11-12 02:34:33,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:33,481 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 66 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:33,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 233 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:34:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2023-11-12 02:34:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 513. [2023-11-12 02:34:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 383 states have (on average 1.1357702349869452) internal successors, (435), 390 states have internal predecessors, (435), 114 states have call successors, (114), 15 states have call predecessors, (114), 15 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-12 02:34:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 663 transitions. [2023-11-12 02:34:33,606 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 663 transitions. Word has length 112 [2023-11-12 02:34:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:33,607 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 663 transitions. [2023-11-12 02:34:33,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:34:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 663 transitions. [2023-11-12 02:34:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-12 02:34:33,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:33,609 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] [2023-11-12 02:34:33,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:34:33,610 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:33,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash -496871011, now seen corresponding path program 1 times [2023-11-12 02:34:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:33,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524477121] [2023-11-12 02:34:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:34:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:34:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:34:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:34:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:34:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:34:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:34:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:34:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:34:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:34:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:34:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:34:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:34:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:34:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:34:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:34:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:39,596 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:34:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524477121] [2023-11-12 02:34:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524477121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:39,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:39,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-12 02:34:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104565606] [2023-11-12 02:34:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:39,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 02:34:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:34:39,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:34:39,600 INFO L87 Difference]: Start difference. First operand 513 states and 663 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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:34:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:43,165 INFO L93 Difference]: Finished difference Result 665 states and 852 transitions. [2023-11-12 02:34:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-12 02:34:43,166 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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 112 [2023-11-12 02:34:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:43,175 INFO L225 Difference]: With dead ends: 665 [2023-11-12 02:34:43,175 INFO L226 Difference]: Without dead ends: 663 [2023-11-12 02:34:43,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2023-11-12 02:34:43,177 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 287 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:43,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 610 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-12 02:34:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2023-11-12 02:34:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 519. [2023-11-12 02:34:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 389 states have (on average 1.1336760925449871) internal successors, (441), 396 states have internal predecessors, (441), 114 states have call successors, (114), 15 states have call predecessors, (114), 15 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-12 02:34:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 669 transitions. [2023-11-12 02:34:43,275 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 669 transitions. Word has length 112 [2023-11-12 02:34:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:43,276 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 669 transitions. [2023-11-12 02:34:43,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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:34:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 669 transitions. [2023-11-12 02:34:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-12 02:34:43,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:43,278 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] [2023-11-12 02:34:43,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:34:43,279 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:43,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash 606069303, now seen corresponding path program 1 times [2023-11-12 02:34:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:43,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963858798] [2023-11-12 02:34:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:43,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:34:43,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:34:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:34:43,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:34:43,439 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:34:43,440 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:34:43,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:34:43,447 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:34:43,451 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:34:43,527 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-12 02:34:43,529 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated [2023-11-12 02:34:43,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:34:43 BoogieIcfgContainer [2023-11-12 02:34:43,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:34:43,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:34:43,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:34:43,564 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:34:43,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:34:19" (3/4) ... [2023-11-12 02:34:43,566 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:34:43,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:34:43,568 INFO L158 Benchmark]: Toolchain (without parser) took 25459.23ms. Allocated memory was 136.3MB in the beginning and 413.1MB in the end (delta: 276.8MB). Free memory was 105.0MB in the beginning and 217.2MB in the end (delta: -112.3MB). Peak memory consumption was 167.5MB. Max. memory is 16.1GB. [2023-11-12 02:34:43,569 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 107.0MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:34:43,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.27ms. Allocated memory is still 136.3MB. Free memory was 104.8MB in the beginning and 92.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:34:43,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.53ms. Allocated memory is still 136.3MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:34:43,570 INFO L158 Benchmark]: Boogie Preprocessor took 44.63ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 88.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:34:43,570 INFO L158 Benchmark]: RCFGBuilder took 648.56ms. Allocated memory is still 136.3MB. Free memory was 88.3MB in the beginning and 72.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 02:34:43,571 INFO L158 Benchmark]: TraceAbstraction took 24346.01ms. Allocated memory was 136.3MB in the beginning and 413.1MB in the end (delta: 276.8MB). Free memory was 71.9MB in the beginning and 217.2MB in the end (delta: -145.4MB). Peak memory consumption was 133.9MB. Max. memory is 16.1GB. [2023-11-12 02:34:43,571 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 413.1MB. Free memory is still 217.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:34:43,573 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.67ms. Allocated memory is still 107.0MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.27ms. Allocated memory is still 136.3MB. Free memory was 104.8MB in the beginning and 92.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.53ms. Allocated memory is still 136.3MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.63ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 88.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 648.56ms. Allocated memory is still 136.3MB. Free memory was 88.3MB in the beginning and 72.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24346.01ms. Allocated memory was 136.3MB in the beginning and 413.1MB in the end (delta: 276.8MB). Free memory was 71.9MB in the beginning and 217.2MB in the end (delta: -145.4MB). Peak memory consumption was 133.9MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 413.1MB. Free memory is still 217.2MB. 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~short16 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 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = -64; [L30] signed char var_1_12 = 5; [L31] signed char var_1_13 = 50; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] unsigned char var_1_16 = 0; [L35] unsigned char var_1_17 = 0; [L36] signed char last_1_var_1_7 = -128; VAL [isInitial=0, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] var_1_3 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L79] var_1_5 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=9999999999993/10, var_1_7=-128] [L80] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=9999999999993/10, var_1_7=-128] [L81] var_1_6 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L82] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L83] var_1_11 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L111] RET updateVariables() [L112] CALL step() [L40] signed long int stepLocal_1 = ((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L41] COND FALSE !(last_1_var_1_7 <= stepLocal_1) [L44] var_1_12 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L46] unsigned char stepLocal_3 = var_1_2; [L47] unsigned long int stepLocal_2 = (((25u) > (var_1_12)) ? (25u) : (var_1_12)); VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L48] COND TRUE stepLocal_3 || var_1_15 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L49] COND TRUE stepLocal_2 <= var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L59] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L59] signed long int stepLocal_0 = var_1_12 ^ var_1_12; [L60] COND TRUE ((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != stepLocal_0 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L61] COND TRUE \read(var_1_14) [L62] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=25] [L67] COND TRUE \read(var_1_14) [L68] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000005, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=25] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000005, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=25] [L103-L104] return (((var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))) && ((last_1_var_1_7 <= (((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7)) ? (var_1_12 == ((signed char) (var_1_13 - 1))) : (var_1_12 == ((signed char) var_1_11)))) && ((var_1_2 || var_1_15) ? ((((((25u) > (var_1_12)) ? (25u) : (var_1_12))) <= var_1_12) ? (var_1_2 ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_17))) : 1) : (var_1_14 == ((unsigned char) var_1_16))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000005, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=25] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=-1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000005, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.2s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1398 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1372 mSDsluCounter, 3417 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2375 mSDsCounter, 372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2257 IncrementalHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 372 mSolverCounterUnsat, 1042 mSDtfsCounter, 2257 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 738 GetRequests, 614 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=8, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 1240 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 1431 NumberOfCodeBlocks, 1431 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1414 ConstructedInterpolants, 0 QuantifiedInterpolants, 4983 SizeOfPredicates, 4 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 6222/6240 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:34:43,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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_4ab6ce41-01e5-4524-a90d-4aebc920170f/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 fccf2d2c93d03d1017d49983a9fd698a073845527500499b9c3f790f8d57593b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:34:46,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:34:46,304 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-12 02:34:46,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:34:46,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:34:46,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:34:46,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:34:46,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:34:46,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:34:46,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:34:46,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:34:46,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:34:46,363 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:34:46,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:34:46,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:34:46,365 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:34:46,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:34:46,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:34:46,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:34:46,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:34:46,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:34:46,369 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:34:46,369 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:34:46,370 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:34:46,371 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:34:46,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:34:46,372 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:34:46,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:34:46,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:34:46,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:34:46,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:34:46,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:34:46,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:34:46,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:34:46,376 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:34:46,377 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:34:46,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:34:46,378 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:34:46,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:34:46,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:34:46,379 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:34:46,380 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:34:46,380 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_4ab6ce41-01e5-4524-a90d-4aebc920170f/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_4ab6ce41-01e5-4524-a90d-4aebc920170f/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 -> fccf2d2c93d03d1017d49983a9fd698a073845527500499b9c3f790f8d57593b [2023-11-12 02:34:46,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:34:46,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:34:46,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:34:46,823 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:34:46,824 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:34:46,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i [2023-11-12 02:34:49,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:34:50,303 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:34:50,304 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i [2023-11-12 02:34:50,313 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/data/575f141ce/f6047d57c0304ff886390e6d682a60b7/FLAG1a592bb64 [2023-11-12 02:34:50,328 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/data/575f141ce/f6047d57c0304ff886390e6d682a60b7 [2023-11-12 02:34:50,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:34:50,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:34:50,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:34:50,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:34:50,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:34:50,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd8cd6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50, skipping insertion in model container [2023-11-12 02:34:50,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,391 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:34:50,560 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_4ab6ce41-01e5-4524-a90d-4aebc920170f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i[915,928] [2023-11-12 02:34:50,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:34:50,625 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:34:50,639 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_4ab6ce41-01e5-4524-a90d-4aebc920170f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i[915,928] [2023-11-12 02:34:50,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:34:50,685 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:34:50,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50 WrapperNode [2023-11-12 02:34:50,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:34:50,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:34:50,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:34:50,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:34:50,696 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:34:50" (1/1) ... [2023-11-12 02:34:50,721 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:34:50" (1/1) ... [2023-11-12 02:34:50,772 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2023-11-12 02:34:50,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:34:50,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:34:50,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:34:50,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:34:50,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:34:50,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:34:50,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:34:50,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:34:50,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (1/1) ... [2023-11-12 02:34:50,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:34:50,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:34:50,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:50,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:34:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:34:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:34:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:34:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:34:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:34:51,082 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:34:51,084 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:34:53,410 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:34:53,417 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:34:53,417 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:34:53,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:34:53 BoogieIcfgContainer [2023-11-12 02:34:53,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:34:53,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:34:53,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:34:53,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:34:53,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:34:50" (1/3) ... [2023-11-12 02:34:53,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7d98e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:34:53, skipping insertion in model container [2023-11-12 02:34:53,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:34:50" (2/3) ... [2023-11-12 02:34:53,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7d98e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:34:53, skipping insertion in model container [2023-11-12 02:34:53,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:34:53" (3/3) ... [2023-11-12 02:34:53,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-81.i [2023-11-12 02:34:53,448 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:34:53,449 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:34:53,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:34:53,525 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;@51275f0d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:34:53,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:34:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 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:34:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-12 02:34:53,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:53,549 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] [2023-11-12 02:34:53,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:53,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:53,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1491841099, now seen corresponding path program 1 times [2023-11-12 02:34:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:34:53,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313524259] [2023-11-12 02:34:53,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:53,578 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:34:53,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:34:53,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:53,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:54,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:34:54,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:34:54,679 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:34:54,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:34:54,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:34:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313524259] [2023-11-12 02:34:54,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313524259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:54,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:54,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:34:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421649727] [2023-11-12 02:34:54,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:54,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:34:54,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:54,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:54,727 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 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) Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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:34:57,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:34:58,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:34:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:34:58,858 INFO L93 Difference]: Finished difference Result 156 states and 269 transitions. [2023-11-12 02:34:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:34:58,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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 105 [2023-11-12 02:34:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:34:58,894 INFO L225 Difference]: With dead ends: 156 [2023-11-12 02:34:58,894 INFO L226 Difference]: Without dead ends: 105 [2023-11-12 02:34:58,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 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:34:58,901 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 72 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:34:58,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 229 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-12 02:34:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-12 02:34:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2023-11-12 02:34:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.25) internal successors, (75), 60 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:34:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2023-11-12 02:34:58,968 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 105 [2023-11-12 02:34:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:34:58,970 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2023-11-12 02:34:58,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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:34:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2023-11-12 02:34:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-12 02:34:58,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:34:58,974 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] [2023-11-12 02:34:58,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:59,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:59,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:34:59,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1098814089, now seen corresponding path program 1 times [2023-11-12 02:34:59,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:34:59,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705853421] [2023-11-12 02:34:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:59,193 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:34:59,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:34:59,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:59,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:34:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:59,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:34:59,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:34:59,613 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:34:59,614 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:34:59,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:34:59,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705853421] [2023-11-12 02:34:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705853421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:59,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:34:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742681156] [2023-11-12 02:34:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:59,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:34:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:34:59,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:34:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:34:59,622 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:35:00,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:35:00,355 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2023-11-12 02:35:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:35:00,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 105 [2023-11-12 02:35:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:35:00,360 INFO L225 Difference]: With dead ends: 142 [2023-11-12 02:35:00,360 INFO L226 Difference]: Without dead ends: 95 [2023-11-12 02:35:00,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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:35:00,363 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:35:00,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 126 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:35:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-12 02:35:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-12 02:35:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 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:35:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2023-11-12 02:35:00,386 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 105 [2023-11-12 02:35:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:35:00,387 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2023-11-12 02:35:00,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:35:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2023-11-12 02:35:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-12 02:35:00,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:35:00,390 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] [2023-11-12 02:35:00,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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)] Ended with exit code 0 [2023-11-12 02:35:00,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:35:00,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:35:00,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:35:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 931984659, now seen corresponding path program 1 times [2023-11-12 02:35:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:35:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228721634] [2023-11-12 02:35:00,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:35:00,614 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:35:00,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:35:00,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:35:00,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab6ce41-01e5-4524-a90d-4aebc920170f/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:35:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:35:00,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:35:00,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:35:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-11-12 02:35:01,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:35:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-12 02:35:01,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:35:01,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228721634] [2023-11-12 02:35:01,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228721634] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:35:01,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:35:01,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-11-12 02:35:01,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788021079] [2023-11-12 02:35:01,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:35:01,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:35:01,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:35:01,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:35:01,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:35:01,284 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)