./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd --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 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:07:08,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:07:08,541 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:07:08,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:07:08,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:07:08,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:07:08,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:07:08,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:07:08,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:07:08,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:07:08,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:07:08,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:07:08,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:07:08,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:07:08,572 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:07:08,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:07:08,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:07:08,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:07:08,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:07:08,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:07:08,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:07:08,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:07:08,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:07:08,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:07:08,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:07:08,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:07:08,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:07:08,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:07:08,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:07:08,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:07:08,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:07:08,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:07:08,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:07:08,575 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd 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 -> 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 [2024-11-13 15:07:08,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:07:08,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:07:08,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:07:08,897 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:07:08,898 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:07:08,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i Unable to find full path for "g++" [2024-11-13 15:07:11,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:07:11,346 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:07:11,346 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-11-13 15:07:11,355 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/data/50f4d327e/b8f80a8350a745d8bfa699b4eb28a648/FLAG072df2a39 [2024-11-13 15:07:11,371 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/data/50f4d327e/b8f80a8350a745d8bfa699b4eb28a648 [2024-11-13 15:07:11,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:07:11,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:07:11,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:07:11,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:07:11,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:07:11,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4461025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11, skipping insertion in model container [2024-11-13 15:07:11,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:07:11,585 WARN L250 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_e20347bb-4105-4242-ab81-19ae93ab18aa/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-11-13 15:07:11,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:07:11,649 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:07:11,659 WARN L250 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_e20347bb-4105-4242-ab81-19ae93ab18aa/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-11-13 15:07:11,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:07:11,722 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:07:11,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11 WrapperNode [2024-11-13 15:07:11,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:07:11,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:07:11,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:07:11,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:07:11,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,798 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-13 15:07:11,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:07:11,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:07:11,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:07:11,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:07:11,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,842 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:07:11,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:07:11,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:07:11,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:07:11,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:07:11,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (1/1) ... [2024-11-13 15:07:11,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:07:11,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:07:11,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:07:11,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:07:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:07:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:07:11,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:07:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:07:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:07:11,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:07:12,047 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:07:12,049 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:07:12,405 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 15:07:12,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:07:12,421 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:07:12,423 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:07:12,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:07:12 BoogieIcfgContainer [2024-11-13 15:07:12,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:07:12,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:07:12,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:07:12,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:07:12,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:07:11" (1/3) ... [2024-11-13 15:07:12,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4349153b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:07:12, skipping insertion in model container [2024-11-13 15:07:12,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:07:11" (2/3) ... [2024-11-13 15:07:12,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4349153b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:07:12, skipping insertion in model container [2024-11-13 15:07:12,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:07:12" (3/3) ... [2024-11-13 15:07:12,438 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-66.i [2024-11-13 15:07:12,459 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:07:12,461 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-66.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:07:12,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:07:12,554 INFO L333 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, 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;@474c7de1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:07:12,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:07:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 15:07:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:07:12,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:12,575 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:07:12,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:12,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1836959452, now seen corresponding path program 1 times [2024-11-13 15:07:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:07:12,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395422165] [2024-11-13 15:07:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:07:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:07:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:07:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:07:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:07:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:07:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:07:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:07:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:07:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:07:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:07:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:07:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:07:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:07:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:07:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:07:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:07:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:07:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:07:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:13,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:07:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395422165] [2024-11-13 15:07:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395422165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:13,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:07:13,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369059712] [2024-11-13 15:07:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:13,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:07:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:07:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:07:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:07:13,127 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:07:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:13,156 INFO L93 Difference]: Finished difference Result 109 states and 192 transitions. [2024-11-13 15:07:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:07:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-13 15:07:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:13,167 INFO L225 Difference]: With dead ends: 109 [2024-11-13 15:07:13,167 INFO L226 Difference]: Without dead ends: 54 [2024-11-13 15:07:13,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:07:13,174 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:13,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:07:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-13 15:07:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-13 15:07:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 15:07:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2024-11-13 15:07:13,228 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 116 [2024-11-13 15:07:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:13,228 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2024-11-13 15:07:13,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:07:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2024-11-13 15:07:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:07:13,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:13,233 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:07:13,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:07:13,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:13,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1298579428, now seen corresponding path program 1 times [2024-11-13 15:07:13,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:07:13,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651863929] [2024-11-13 15:07:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:13,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:07:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:07:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:07:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:07:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:07:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:07:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:07:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:07:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:07:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:07:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:07:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:07:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:07:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:07:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:07:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:07:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:07:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:07:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:07:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:07:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651863929] [2024-11-13 15:07:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651863929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:13,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:07:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191790895] [2024-11-13 15:07:13,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:13,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:07:13,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:07:13,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:07:13,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:07:13,735 INFO L87 Difference]: Start difference. First operand 54 states and 83 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:13,843 INFO L93 Difference]: Finished difference Result 155 states and 241 transitions. [2024-11-13 15:07:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:07:13,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-13 15:07:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:13,846 INFO L225 Difference]: With dead ends: 155 [2024-11-13 15:07:13,846 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 15:07:13,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:07:13,848 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 71 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:13,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 201 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:07:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 15:07:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-11-13 15:07:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 15:07:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-13 15:07:13,879 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 116 [2024-11-13 15:07:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:13,880 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-13 15:07:13,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-13 15:07:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:07:13,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:13,882 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:07:13,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:07:13,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:13,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1221380506, now seen corresponding path program 1 times [2024-11-13 15:07:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:07:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435308648] [2024-11-13 15:07:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:07:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:07:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:07:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:07:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:07:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:07:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:07:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:07:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:07:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:07:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:07:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:07:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:07:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:07:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:07:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:07:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:07:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:07:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:07:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:07:14,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435308648] [2024-11-13 15:07:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435308648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:14,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:14,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:07:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459598122] [2024-11-13 15:07:14,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:07:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:07:14,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:07:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:07:14,450 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:14,789 INFO L93 Difference]: Finished difference Result 316 states and 471 transitions. [2024-11-13 15:07:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:07:14,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-13 15:07:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:14,794 INFO L225 Difference]: With dead ends: 316 [2024-11-13 15:07:14,794 INFO L226 Difference]: Without dead ends: 217 [2024-11-13 15:07:14,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:07:14,797 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 68 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:14,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 180 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:07:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-13 15:07:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2024-11-13 15:07:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 130 states have internal predecessors, (163), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 15:07:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 315 transitions. [2024-11-13 15:07:14,865 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 315 transitions. Word has length 116 [2024-11-13 15:07:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:14,866 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 315 transitions. [2024-11-13 15:07:14,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 315 transitions. [2024-11-13 15:07:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:07:14,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:14,869 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:07:14,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:07:14,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:14,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2030727132, now seen corresponding path program 1 times [2024-11-13 15:07:14,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:07:14,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420660571] [2024-11-13 15:07:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:14,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:07:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:07:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:07:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:07:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:07:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:07:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:07:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:07:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:07:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:07:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:07:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:07:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:07:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:07:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:07:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:07:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:07:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:07:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:07:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:20,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:07:20,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420660571] [2024-11-13 15:07:20,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420660571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:20,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:07:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930321769] [2024-11-13 15:07:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:20,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:07:20,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:07:20,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:07:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:07:20,784 INFO L87 Difference]: Start difference. First operand 212 states and 315 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:22,408 INFO L93 Difference]: Finished difference Result 546 states and 741 transitions. [2024-11-13 15:07:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:07:22,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-13 15:07:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:22,414 INFO L225 Difference]: With dead ends: 546 [2024-11-13 15:07:22,415 INFO L226 Difference]: Without dead ends: 544 [2024-11-13 15:07:22,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:07:22,416 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 290 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:22,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 342 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:07:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-13 15:07:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 322. [2024-11-13 15:07:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 223 states have (on average 1.3183856502242153) internal successors, (294), 228 states have internal predecessors, (294), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 15:07:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 470 transitions. [2024-11-13 15:07:22,532 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 470 transitions. Word has length 116 [2024-11-13 15:07:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:22,533 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 470 transitions. [2024-11-13 15:07:22,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 470 transitions. [2024-11-13 15:07:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:07:22,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:22,540 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:07:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:07:22,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2032574174, now seen corresponding path program 1 times [2024-11-13 15:07:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:07:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538578836] [2024-11-13 15:07:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:07:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:07:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:07:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:07:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:07:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:07:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:07:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:07:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:07:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:07:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:07:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:07:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:07:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:07:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:07:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:07:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:07:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:07:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:07:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:26,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:07:26,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538578836] [2024-11-13 15:07:26,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538578836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:26,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:26,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:07:26,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590135230] [2024-11-13 15:07:26,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:26,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:07:26,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:07:26,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:07:26,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:07:26,681 INFO L87 Difference]: Start difference. First operand 322 states and 470 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:28,400 INFO L93 Difference]: Finished difference Result 508 states and 692 transitions. [2024-11-13 15:07:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:07:28,402 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-13 15:07:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:28,410 INFO L225 Difference]: With dead ends: 508 [2024-11-13 15:07:28,413 INFO L226 Difference]: Without dead ends: 506 [2024-11-13 15:07:28,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:07:28,414 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 211 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:28,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 434 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:07:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-13 15:07:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 322. [2024-11-13 15:07:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 223 states have (on average 1.3183856502242153) internal successors, (294), 228 states have internal predecessors, (294), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 15:07:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 470 transitions. [2024-11-13 15:07:28,508 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 470 transitions. Word has length 116 [2024-11-13 15:07:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:28,511 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 470 transitions. [2024-11-13 15:07:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 470 transitions. [2024-11-13 15:07:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:07:28,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:28,517 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:07:28,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:07:28,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:28,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1691606438, now seen corresponding path program 1 times [2024-11-13 15:07:28,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:07:28,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387728303] [2024-11-13 15:07:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:28,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:07:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:07:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:07:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:07:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:07:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:07:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:07:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:07:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:07:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:07:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:07:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:07:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:07:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:07:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:07:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:07:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:07:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:07:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:07:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:33,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:07:33,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387728303] [2024-11-13 15:07:33,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387728303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:33,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:33,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:07:33,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933010183] [2024-11-13 15:07:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:33,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:07:33,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:07:33,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:07:33,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:07:33,136 INFO L87 Difference]: Start difference. First operand 322 states and 470 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:35,228 INFO L93 Difference]: Finished difference Result 636 states and 906 transitions. [2024-11-13 15:07:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:07:35,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-13 15:07:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:35,232 INFO L225 Difference]: With dead ends: 636 [2024-11-13 15:07:35,233 INFO L226 Difference]: Without dead ends: 462 [2024-11-13 15:07:35,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:07:35,235 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 165 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:35,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 410 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:07:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-13 15:07:35,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 335. [2024-11-13 15:07:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 236 states have (on average 1.326271186440678) internal successors, (313), 241 states have internal predecessors, (313), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 15:07:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 489 transitions. [2024-11-13 15:07:35,317 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 489 transitions. Word has length 116 [2024-11-13 15:07:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:35,318 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 489 transitions. [2024-11-13 15:07:35,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 489 transitions. [2024-11-13 15:07:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:07:35,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:35,321 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:07:35,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:07:35,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:35,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1689759396, now seen corresponding path program 1 times [2024-11-13 15:07:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:07:35,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622108664] [2024-11-13 15:07:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:35,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:07:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:07:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:07:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:07:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:07:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:07:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:07:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:07:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:07:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:07:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:07:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:07:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:07:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:07:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:07:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:07:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:07:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:07:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:07:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:40,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:07:40,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622108664] [2024-11-13 15:07:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622108664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:07:40,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137953276] [2024-11-13 15:07:40,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:40,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:07:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:07:40,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:07:40,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:07:40,438 INFO L87 Difference]: Start difference. First operand 335 states and 489 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:43,232 INFO L93 Difference]: Finished difference Result 462 states and 640 transitions. [2024-11-13 15:07:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:07:43,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-13 15:07:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:43,236 INFO L225 Difference]: With dead ends: 462 [2024-11-13 15:07:43,236 INFO L226 Difference]: Without dead ends: 460 [2024-11-13 15:07:43,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:07:43,238 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 165 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:43,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 388 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:07:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-13 15:07:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 335. [2024-11-13 15:07:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 236 states have (on average 1.326271186440678) internal successors, (313), 241 states have internal predecessors, (313), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 15:07:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 489 transitions. [2024-11-13 15:07:43,319 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 489 transitions. Word has length 116 [2024-11-13 15:07:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:43,320 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 489 transitions. [2024-11-13 15:07:43,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 489 transitions. [2024-11-13 15:07:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:07:43,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:43,323 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:07:43,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:07:43,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:43,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash 882259812, now seen corresponding path program 1 times [2024-11-13 15:07:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:07:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094073347] [2024-11-13 15:07:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:07:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:08:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:08:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:08:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:08:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:08:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:08:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:08:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:08:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:08:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:08:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:08:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:08:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:08:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:08:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:08:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:08:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:08:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:08:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:08:12,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:08:12,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094073347] [2024-11-13 15:08:12,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094073347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:08:12,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:08:12,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:08:12,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127849247] [2024-11-13 15:08:12,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:08:12,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:08:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:08:12,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:08:12,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:08:12,197 INFO L87 Difference]: Start difference. First operand 335 states and 489 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:08:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:13,440 INFO L93 Difference]: Finished difference Result 441 states and 618 transitions. [2024-11-13 15:08:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:08:13,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-13 15:08:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:13,447 INFO L225 Difference]: With dead ends: 441 [2024-11-13 15:08:13,447 INFO L226 Difference]: Without dead ends: 439 [2024-11-13 15:08:13,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:08:13,448 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 113 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:13,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 367 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:08:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-13 15:08:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 336. [2024-11-13 15:08:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 237 states have (on average 1.3248945147679325) internal successors, (314), 242 states have internal predecessors, (314), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 15:08:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2024-11-13 15:08:13,520 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 116 [2024-11-13 15:08:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:13,520 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2024-11-13 15:08:13,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:08:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2024-11-13 15:08:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:08:13,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:13,524 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:08:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:08:13,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:13,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1329662554, now seen corresponding path program 1 times [2024-11-13 15:08:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:08:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644270225] [2024-11-13 15:08:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:08:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:08:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:08:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:08:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:08:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:08:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:08:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:08:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:08:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:08:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:08:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:08:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:08:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:08:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:08:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:08:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:08:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:08:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:08:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:08:13,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:08:13,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644270225] [2024-11-13 15:08:13,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644270225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:08:13,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:08:13,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:08:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477991002] [2024-11-13 15:08:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:08:13,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:08:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:08:13,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:08:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:08:13,708 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:08:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:13,811 INFO L93 Difference]: Finished difference Result 702 states and 1031 transitions. [2024-11-13 15:08:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:08:13,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-13 15:08:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:13,820 INFO L225 Difference]: With dead ends: 702 [2024-11-13 15:08:13,820 INFO L226 Difference]: Without dead ends: 411 [2024-11-13 15:08:13,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:08:13,822 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:13,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 159 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:08:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-13 15:08:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2024-11-13 15:08:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 284 states have (on average 1.3169014084507042) internal successors, (374), 290 states have internal predecessors, (374), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 104 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-13 15:08:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2024-11-13 15:08:13,914 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 116 [2024-11-13 15:08:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:13,914 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2024-11-13 15:08:13,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:08:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2024-11-13 15:08:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:08:13,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:13,916 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:08:13,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:08:13,917 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:13,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1902296280, now seen corresponding path program 1 times [2024-11-13 15:08:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:08:13,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259939854] [2024-11-13 15:08:13,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:13,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:08:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:08:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:08:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:08:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:08:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:08:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:08:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:08:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:08:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:08:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:08:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:08:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:08:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:08:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:08:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:08:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:08:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:08:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:08:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:08:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:08:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259939854] [2024-11-13 15:08:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259939854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:08:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:08:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:08:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108974943] [2024-11-13 15:08:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:08:14,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:08:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:08:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:08:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:08:14,254 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:08:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:14,547 INFO L93 Difference]: Finished difference Result 782 states and 1126 transitions. [2024-11-13 15:08:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:08:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-13 15:08:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:14,552 INFO L225 Difference]: With dead ends: 782 [2024-11-13 15:08:14,552 INFO L226 Difference]: Without dead ends: 419 [2024-11-13 15:08:14,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:08:14,554 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 117 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:14,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 119 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:08:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-13 15:08:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2024-11-13 15:08:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 279 states have (on average 1.2616487455197132) internal successors, (352), 285 states have internal predecessors, (352), 116 states have call successors, (116), 15 states have call predecessors, (116), 15 states have return successors, (116), 110 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-13 15:08:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 584 transitions. [2024-11-13 15:08:14,631 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 584 transitions. Word has length 116 [2024-11-13 15:08:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:14,631 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 584 transitions. [2024-11-13 15:08:14,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:08:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 584 transitions. [2024-11-13 15:08:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 15:08:14,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:14,633 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:08:14,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:08:14,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:14,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash 463459208, now seen corresponding path program 1 times [2024-11-13 15:08:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:08:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805973115] [2024-11-13 15:08:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:14,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:08:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:08:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:08:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:08:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:08:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:08:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:08:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:08:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:08:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:08:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:08:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:08:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:08:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:08:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:08:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:08:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:08:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:08:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:08:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:08:17,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:08:17,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805973115] [2024-11-13 15:08:17,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805973115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:08:17,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:08:17,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:08:17,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984585458] [2024-11-13 15:08:17,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:08:17,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:08:17,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:08:17,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:08:17,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:08:17,373 INFO L87 Difference]: Start difference. First operand 411 states and 584 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:08:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:18,629 INFO L93 Difference]: Finished difference Result 521 states and 703 transitions. [2024-11-13 15:08:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:08:18,630 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-13 15:08:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:18,634 INFO L225 Difference]: With dead ends: 521 [2024-11-13 15:08:18,634 INFO L226 Difference]: Without dead ends: 519 [2024-11-13 15:08:18,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:08:18,636 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 165 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:18,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 424 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:08:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-13 15:08:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 389. [2024-11-13 15:08:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 261 states have (on average 1.2720306513409962) internal successors, (332), 265 states have internal predecessors, (332), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 15:08:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 556 transitions. [2024-11-13 15:08:18,705 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 556 transitions. Word has length 117 [2024-11-13 15:08:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:18,706 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 556 transitions. [2024-11-13 15:08:18,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:08:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 556 transitions. [2024-11-13 15:08:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 15:08:18,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:18,709 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:08:18,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:08:18,710 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:18,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 461612166, now seen corresponding path program 1 times [2024-11-13 15:08:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:08:18,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916465170] [2024-11-13 15:08:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:18,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:08:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:08:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:08:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:08:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:08:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:08:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:08:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:08:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:08:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:08:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:08:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:08:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:08:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:08:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:08:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:08:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:08:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:08:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:08:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:08:21,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:08:21,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916465170] [2024-11-13 15:08:21,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916465170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:08:21,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:08:21,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:08:21,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396887926] [2024-11-13 15:08:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:08:21,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:08:21,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:08:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:08:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:08:21,382 INFO L87 Difference]: Start difference. First operand 389 states and 556 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:08:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:22,946 INFO L93 Difference]: Finished difference Result 519 states and 700 transitions. [2024-11-13 15:08:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:08:22,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-13 15:08:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:22,951 INFO L225 Difference]: With dead ends: 519 [2024-11-13 15:08:22,951 INFO L226 Difference]: Without dead ends: 517 [2024-11-13 15:08:22,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:08:22,953 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 152 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:22,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:08:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-13 15:08:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 381. [2024-11-13 15:08:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 253 states have (on average 1.256916996047431) internal successors, (318), 257 states have internal predecessors, (318), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 15:08:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 542 transitions. [2024-11-13 15:08:23,037 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 542 transitions. Word has length 117 [2024-11-13 15:08:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:23,038 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 542 transitions. [2024-11-13 15:08:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:08:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 542 transitions. [2024-11-13 15:08:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 15:08:23,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:23,041 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:08:23,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:08:23,041 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:23,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1883324476, now seen corresponding path program 1 times [2024-11-13 15:08:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:08:23,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758333719] [2024-11-13 15:08:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:23,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:08:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:08:23,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219606682] [2024-11-13 15:08:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:23,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:08:23,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:08:23,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:08:23,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:08:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:08:23,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:08:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:08:23,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:08:23,507 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:08:23,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:08:23,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:08:23,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:08:23,716 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:08:23,867 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:08:23,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:08:23 BoogieIcfgContainer [2024-11-13 15:08:23,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:08:23,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:08:23,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:08:23,875 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:08:23,876 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:07:12" (3/4) ... [2024-11-13 15:08:23,879 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:08:23,880 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:08:23,881 INFO L158 Benchmark]: Toolchain (without parser) took 72505.31ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 92.8MB in the beginning and 487.0MB in the end (delta: -394.2MB). Peak memory consumption was 247.2MB. Max. memory is 16.1GB. [2024-11-13 15:08:23,882 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:08:23,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.11ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 79.4MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:08:23,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.22ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 76.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:08:23,883 INFO L158 Benchmark]: Boogie Preprocessor took 59.24ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 72.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:08:23,884 INFO L158 Benchmark]: RCFGBuilder took 564.59ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 54.2MB in the end (delta: 18.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:08:23,884 INFO L158 Benchmark]: TraceAbstraction took 71447.04ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 53.7MB in the beginning and 487.2MB in the end (delta: -433.5MB). Peak memory consumption was 196.8MB. Max. memory is 16.1GB. [2024-11-13 15:08:23,885 INFO L158 Benchmark]: Witness Printer took 5.43ms. Allocated memory is still 755.0MB. Free memory was 487.2MB in the beginning and 487.0MB in the end (delta: 159.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:08:23,887 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.11ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 79.4MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.22ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 76.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.24ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 72.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 564.59ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 54.2MB in the end (delta: 18.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 71447.04ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 53.7MB in the beginning and 487.2MB in the end (delta: -433.5MB). Peak memory consumption was 196.8MB. Max. memory is 16.1GB. * Witness Printer took 5.43ms. Allocated memory is still 755.0MB. Free memory was 487.2MB in the beginning and 487.0MB in the end (delta: 159.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L83] var_1_3 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L84] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L85] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L85] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L86] var_1_4 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L87] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L88] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L88] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] var_1_6 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L91] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L91] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L92] var_1_7 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L93] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L94] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L94] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L95] var_1_10 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L96] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L97] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L97] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L98] var_1_11 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L99] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L100] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L100] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L101] var_1_14 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L102] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L103] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L103] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L104] var_1_20 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L105] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L106] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L106] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L107] var_1_21 = __VERIFIER_nondet_short() [L108] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L108] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L109] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L109] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L123] RET updateVariables() [L124] CALL step() [L43] COND FALSE !(-25 == var_1_6) [L48] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=49278] [L50] COND TRUE var_1_8 >= var_1_7 [L51] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=49278] [L53] COND TRUE \read(var_1_12) [L54] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=49278] [L56] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=49278] [L57] COND TRUE \read(var_1_12) [L58] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=49278] [L61] COND TRUE var_1_1 < var_1_6 [L62] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-128, var_1_19=25, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=49278] [L66] COND TRUE \read(var_1_12) [L67] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-128, var_1_19=-16257, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=49278] [L69] COND TRUE -64 > (var_1_6 + var_1_19) [L70] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-128, var_1_19=-16257, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=49278] [L78] COND FALSE !(var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-128, var_1_19=-16257, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=49278] [L124] RET step() [L125] CALL, EXPR property() [L115-L116] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-128, var_1_19=-16257, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=49278] [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-128, var_1_19=-16257, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=49278] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-128, var_1_19=-16257, var_1_1=-126, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=49278] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.2s, OverallIterations: 13, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1559 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1559 mSDsluCounter, 3583 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2506 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2244 IncrementalHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 1077 mSDtfsCounter, 2244 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 566 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=10, InterpolantAutomatonStates: 96, 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, 12 MinimizatonAttempts, 1046 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 55.0s InterpolantComputationTime, 1628 NumberOfCodeBlocks, 1628 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1382 ConstructedInterpolants, 0 QuantifiedInterpolants, 9701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 7344/7344 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 [2024-11-13 15:08:24,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd --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 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:08:26,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:08:26,990 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:08:27,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:08:27,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:08:27,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:08:27,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:08:27,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:08:27,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:08:27,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:08:27,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:08:27,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:08:27,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:08:27,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:08:27,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:08:27,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:08:27,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:08:27,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:08:27,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:08:27,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:08:27,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:08:27,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:08:27,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:08:27,049 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:08:27,049 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:08:27,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:08:27,049 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:08:27,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:08:27,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:08:27,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:08:27,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:08:27,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:08:27,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:08:27,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:08:27,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:08:27,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:08:27,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:08:27,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:08:27,050 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:08:27,050 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:08:27,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:08:27,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:08:27,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:08:27,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:08:27,051 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd 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 -> 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 [2024-11-13 15:08:27,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:08:27,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:08:27,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:08:27,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:08:27,345 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:08:27,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i Unable to find full path for "g++" [2024-11-13 15:08:29,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:08:29,674 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:08:29,676 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-11-13 15:08:29,694 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/data/d73ebd0f4/20a0f71ea6ef498a9771f5592350f292/FLAG44956903a [2024-11-13 15:08:29,716 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/data/d73ebd0f4/20a0f71ea6ef498a9771f5592350f292 [2024-11-13 15:08:29,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:08:29,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:08:29,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:08:29,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:08:29,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:08:29,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:08:29" (1/1) ... [2024-11-13 15:08:29,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f5b6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:29, skipping insertion in model container [2024-11-13 15:08:29,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:08:29" (1/1) ... [2024-11-13 15:08:29,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:08:29,956 WARN L250 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_e20347bb-4105-4242-ab81-19ae93ab18aa/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-11-13 15:08:30,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:08:30,056 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:08:30,068 WARN L250 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_e20347bb-4105-4242-ab81-19ae93ab18aa/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-11-13 15:08:30,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:08:30,144 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:08:30,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30 WrapperNode [2024-11-13 15:08:30,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:08:30,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:08:30,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:08:30,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:08:30,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,211 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-13 15:08:30,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:08:30,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:08:30,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:08:30,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:08:30,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,248 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:08:30,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:08:30,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:08:30,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:08:30,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:08:30,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (1/1) ... [2024-11-13 15:08:30,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:08:30,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:08:30,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:08:30,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:08:30,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:08:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:08:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:08:30,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:08:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:08:30,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:08:30,446 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:08:30,448 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:08:30,944 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 15:08:30,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:08:30,956 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:08:30,956 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:08:30,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:08:30 BoogieIcfgContainer [2024-11-13 15:08:30,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:08:30,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:08:30,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:08:30,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:08:30,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:08:29" (1/3) ... [2024-11-13 15:08:30,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ad986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:08:30, skipping insertion in model container [2024-11-13 15:08:30,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:08:30" (2/3) ... [2024-11-13 15:08:30,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ad986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:08:30, skipping insertion in model container [2024-11-13 15:08:30,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:08:30" (3/3) ... [2024-11-13 15:08:30,970 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-66.i [2024-11-13 15:08:30,987 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:08:30,989 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-66.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:08:31,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:08:31,058 INFO L333 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, 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;@74ffaba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:08:31,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:08:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 15:08:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:08:31,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:31,076 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:08:31,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:31,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:31,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1836959452, now seen corresponding path program 1 times [2024-11-13 15:08:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:08:31,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217997007] [2024-11-13 15:08:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:31,095 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 [2024-11-13 15:08:31,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:08:31,100 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:08:31,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:08:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:31,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:08:31,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:08:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-13 15:08:31,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:08:31,429 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:08:31,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217997007] [2024-11-13 15:08:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217997007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:08:31,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:08:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:08:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138560854] [2024-11-13 15:08:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:08:31,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:08:31,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:08:31,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:08:31,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:08:31,467 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:08:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:31,502 INFO L93 Difference]: Finished difference Result 109 states and 192 transitions. [2024-11-13 15:08:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:08:31,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-13 15:08:31,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:31,512 INFO L225 Difference]: With dead ends: 109 [2024-11-13 15:08:31,512 INFO L226 Difference]: Without dead ends: 54 [2024-11-13 15:08:31,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:08:31,520 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:31,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:08:31,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-13 15:08:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-13 15:08:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 15:08:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2024-11-13 15:08:31,568 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 116 [2024-11-13 15:08:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:31,570 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2024-11-13 15:08:31,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:08:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2024-11-13 15:08:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:08:31,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:31,577 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:08:31,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 15:08:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:08:31,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:31,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1298579428, now seen corresponding path program 1 times [2024-11-13 15:08:31,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:08:31,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865305441] [2024-11-13 15:08:31,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:31,780 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 [2024-11-13 15:08:31,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:08:31,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:08:31,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:08:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:32,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:08:32,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:08:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 251 proven. 12 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-11-13 15:08:32,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:08:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 39 proven. 12 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-13 15:08:32,712 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:08:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865305441] [2024-11-13 15:08:32,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865305441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:08:32,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:08:32,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-13 15:08:32,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651363951] [2024-11-13 15:08:32,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:08:32,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:08:32,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:08:32,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:08:32,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:08:32,719 INFO L87 Difference]: Start difference. First operand 54 states and 83 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-13 15:08:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:33,309 INFO L93 Difference]: Finished difference Result 112 states and 168 transitions. [2024-11-13 15:08:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:08:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 116 [2024-11-13 15:08:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:33,318 INFO L225 Difference]: With dead ends: 112 [2024-11-13 15:08:33,318 INFO L226 Difference]: Without dead ends: 61 [2024-11-13 15:08:33,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:08:33,322 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 157 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:33,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 114 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:08:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-13 15:08:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-13 15:08:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 15:08:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2024-11-13 15:08:33,359 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 116 [2024-11-13 15:08:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:33,360 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2024-11-13 15:08:33,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-13 15:08:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2024-11-13 15:08:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:08:33,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:33,365 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:08:33,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:08:33,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:08:33,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:33,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:33,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1691606438, now seen corresponding path program 1 times [2024-11-13 15:08:33,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:08:33,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315638459] [2024-11-13 15:08:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:33,568 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 [2024-11-13 15:08:33,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:08:33,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 15:08:33,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e20347bb-4105-4242-ab81-19ae93ab18aa/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 15:08:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:08:33,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 15:08:33,735 INFO L278 TraceCheckSpWp]: Computing forward predicates...