./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/lockfree-3.2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/lockfree-3.2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:30:03,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:30:03,815 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:30:03,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:30:03,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:30:03,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:30:03,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:30:03,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:30:03,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:30:03,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:30:03,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:30:03,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:30:03,871 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:30:03,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:30:03,872 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:30:03,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:30:03,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:30:03,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:30:03,875 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:30:03,875 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:30:03,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:30:03,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:30:03,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:30:03,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:30:03,878 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:30:03,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:30:03,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:30:03,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:30:03,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:30:03,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:30:03,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:30:03,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:30:03,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:30:03,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:30:03,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:30:03,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:30:03,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:30:03,884 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:30:03,884 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 [2023-11-12 02:30:04,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:30:04,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:30:04,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:30:04,238 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:30:04,239 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:30:04,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/memsafety/lockfree-3.2.i [2023-11-12 02:30:07,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:30:07,765 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:30:07,765 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/sv-benchmarks/c/memsafety/lockfree-3.2.i [2023-11-12 02:30:07,783 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/data/5375251a4/29cdb28808b64cf3a5a5866c8f69cdd5/FLAGe13f34325 [2023-11-12 02:30:07,798 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/data/5375251a4/29cdb28808b64cf3a5a5866c8f69cdd5 [2023-11-12 02:30:07,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:30:07,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:30:07,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:30:07,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:30:07,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:30:07,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:30:07" (1/1) ... [2023-11-12 02:30:07,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21cf6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:07, skipping insertion in model container [2023-11-12 02:30:07,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:30:07" (1/1) ... [2023-11-12 02:30:07,876 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:30:08,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:30:08,358 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:30:08,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:30:08,476 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:30:08,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08 WrapperNode [2023-11-12 02:30:08,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:30:08,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:30:08,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:30:08,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:30:08,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,547 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 127 [2023-11-12 02:30:08,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:30:08,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:30:08,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:30:08,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:30:08,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:30:08,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:30:08,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:30:08,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:30:08,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (1/1) ... [2023-11-12 02:30:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:30:08,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:30:08,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:30:08,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:30:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:30:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:30:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:30:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:30:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:30:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:30:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:30:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:30:08,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:30:08,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:30:08,915 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:30:08,918 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:30:09,435 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:30:09,444 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:30:09,446 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 02:30:09,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:09 BoogieIcfgContainer [2023-11-12 02:30:09,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:30:09,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:30:09,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:30:09,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:30:09,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:30:07" (1/3) ... [2023-11-12 02:30:09,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2a7451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:30:09, skipping insertion in model container [2023-11-12 02:30:09,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:08" (2/3) ... [2023-11-12 02:30:09,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2a7451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:30:09, skipping insertion in model container [2023-11-12 02:30:09,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:09" (3/3) ... [2023-11-12 02:30:09,467 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.2.i [2023-11-12 02:30:09,493 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:30:09,493 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-11-12 02:30:09,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:30:09,576 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5a004f24, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:30:09,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-11-12 02:30:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 02:30:09,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:09,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:30:09,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:09,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:09,601 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2023-11-12 02:30:09,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:09,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323316461] [2023-11-12 02:30:09,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:09,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:09,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323316461] [2023-11-12 02:30:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323316461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:09,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:09,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765138458] [2023-11-12 02:30:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:09,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:30:09,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:09,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:30:09,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:30:09,877 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:09,904 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2023-11-12 02:30:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:30:09,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-12 02:30:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:09,917 INFO L225 Difference]: With dead ends: 64 [2023-11-12 02:30:09,917 INFO L226 Difference]: Without dead ends: 62 [2023-11-12 02:30:09,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:30:09,925 INFO L413 NwaCegarLoop]: 81 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, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:09,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-12 02:30:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-12 02:30:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-11-12 02:30:09,973 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2023-11-12 02:30:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:09,973 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-11-12 02:30:09,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-11-12 02:30:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 02:30:09,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:09,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:09,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:30:09,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:09,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2023-11-12 02:30:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:09,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584520914] [2023-11-12 02:30:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:10,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584520914] [2023-11-12 02:30:10,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584520914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:10,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:10,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:30:10,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360012835] [2023-11-12 02:30:10,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:10,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:10,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:10,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:10,078 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:10,108 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2023-11-12 02:30:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:10,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 02:30:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:10,110 INFO L225 Difference]: With dead ends: 63 [2023-11-12 02:30:10,110 INFO L226 Difference]: Without dead ends: 63 [2023-11-12 02:30:10,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:10,112 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:10,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-12 02:30:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-12 02:30:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2023-11-12 02:30:10,124 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2023-11-12 02:30:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:10,124 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2023-11-12 02:30:10,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2023-11-12 02:30:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 02:30:10,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:10,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:10,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:30:10,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:10,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2023-11-12 02:30:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:10,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764328039] [2023-11-12 02:30:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:10,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764328039] [2023-11-12 02:30:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764328039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670345251] [2023-11-12 02:30:10,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:10,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:10,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:10,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:10,203 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:10,262 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2023-11-12 02:30:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:10,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 02:30:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:10,267 INFO L225 Difference]: With dead ends: 111 [2023-11-12 02:30:10,269 INFO L226 Difference]: Without dead ends: 111 [2023-11-12 02:30:10,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:10,272 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:10,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-12 02:30:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2023-11-12 02:30:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2023-11-12 02:30:10,299 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2023-11-12 02:30:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:10,300 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2023-11-12 02:30:10,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2023-11-12 02:30:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 02:30:10,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:10,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:10,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:30:10,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:10,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2023-11-12 02:30:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48092453] [2023-11-12 02:30:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:10,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:10,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48092453] [2023-11-12 02:30:10,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48092453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:10,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:10,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:30:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305543073] [2023-11-12 02:30:10,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:10,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:30:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:30:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:30:10,452 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:10,563 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2023-11-12 02:30:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:30:10,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 02:30:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:10,565 INFO L225 Difference]: With dead ends: 122 [2023-11-12 02:30:10,565 INFO L226 Difference]: Without dead ends: 122 [2023-11-12 02:30:10,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:30:10,567 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:10,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 208 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:30:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-12 02:30:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2023-11-12 02:30:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.9) internal successors, (171), 109 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2023-11-12 02:30:10,580 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 8 [2023-11-12 02:30:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:10,580 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2023-11-12 02:30:10,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2023-11-12 02:30:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 02:30:10,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:10,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:10,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:30:10,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:10,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2023-11-12 02:30:10,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:10,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146306079] [2023-11-12 02:30:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:10,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:10,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:10,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146306079] [2023-11-12 02:30:10,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146306079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:10,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:10,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:10,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108183036] [2023-11-12 02:30:10,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:10,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:10,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:10,629 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:10,690 INFO L93 Difference]: Finished difference Result 207 states and 321 transitions. [2023-11-12 02:30:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 02:30:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:10,693 INFO L225 Difference]: With dead ends: 207 [2023-11-12 02:30:10,693 INFO L226 Difference]: Without dead ends: 204 [2023-11-12 02:30:10,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:10,695 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:10,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:30:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-12 02:30:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 183. [2023-11-12 02:30:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 182 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 305 transitions. [2023-11-12 02:30:10,713 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 305 transitions. Word has length 8 [2023-11-12 02:30:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:10,713 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 305 transitions. [2023-11-12 02:30:10,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 305 transitions. [2023-11-12 02:30:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 02:30:10,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:10,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:10,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:30:10,725 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:10,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2023-11-12 02:30:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:10,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628786878] [2023-11-12 02:30:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:10,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:10,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628786878] [2023-11-12 02:30:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628786878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718672661] [2023-11-12 02:30:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:10,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:10,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:10,789 INFO L87 Difference]: Start difference. First operand 183 states and 305 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:10,859 INFO L93 Difference]: Finished difference Result 274 states and 434 transitions. [2023-11-12 02:30:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:10,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 02:30:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:10,865 INFO L225 Difference]: With dead ends: 274 [2023-11-12 02:30:10,865 INFO L226 Difference]: Without dead ends: 274 [2023-11-12 02:30:10,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:10,877 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:10,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:30:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-11-12 02:30:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 253. [2023-11-12 02:30:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 235 states have (on average 1.7872340425531914) internal successors, (420), 252 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 420 transitions. [2023-11-12 02:30:10,898 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 420 transitions. Word has length 8 [2023-11-12 02:30:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:10,899 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 420 transitions. [2023-11-12 02:30:10,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 420 transitions. [2023-11-12 02:30:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 02:30:10,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:10,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:10,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:30:10,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:10,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2023-11-12 02:30:10,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243740531] [2023-11-12 02:30:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:10,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243740531] [2023-11-12 02:30:10,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243740531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:10,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:10,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934440549] [2023-11-12 02:30:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:10,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:10,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:10,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:10,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:10,987 INFO L87 Difference]: Start difference. First operand 253 states and 420 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:11,044 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2023-11-12 02:30:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:11,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 02:30:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:11,047 INFO L225 Difference]: With dead ends: 269 [2023-11-12 02:30:11,048 INFO L226 Difference]: Without dead ends: 269 [2023-11-12 02:30:11,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:11,049 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:11,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:30:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-11-12 02:30:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2023-11-12 02:30:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 235 states have (on average 1.7361702127659575) internal successors, (408), 250 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 408 transitions. [2023-11-12 02:30:11,062 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 408 transitions. Word has length 8 [2023-11-12 02:30:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:11,062 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 408 transitions. [2023-11-12 02:30:11,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 408 transitions. [2023-11-12 02:30:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 02:30:11,063 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:11,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:11,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:30:11,064 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:11,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2023-11-12 02:30:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377250015] [2023-11-12 02:30:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377250015] [2023-11-12 02:30:11,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377250015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:11,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:11,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:30:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913149868] [2023-11-12 02:30:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:11,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:30:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:11,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:30:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:30:11,123 INFO L87 Difference]: Start difference. First operand 251 states and 408 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:11,165 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2023-11-12 02:30:11,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:30:11,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-12 02:30:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:11,167 INFO L225 Difference]: With dead ends: 215 [2023-11-12 02:30:11,168 INFO L226 Difference]: Without dead ends: 215 [2023-11-12 02:30:11,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:30:11,170 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 53 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:11,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 193 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-12 02:30:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 188. [2023-11-12 02:30:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 176 states have (on average 1.6534090909090908) internal successors, (291), 187 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 291 transitions. [2023-11-12 02:30:11,183 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 291 transitions. Word has length 9 [2023-11-12 02:30:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:11,183 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 291 transitions. [2023-11-12 02:30:11,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 291 transitions. [2023-11-12 02:30:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 02:30:11,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:11,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:11,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:30:11,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:11,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2023-11-12 02:30:11,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:11,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145540204] [2023-11-12 02:30:11,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:11,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145540204] [2023-11-12 02:30:11,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145540204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:11,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:11,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:30:11,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434617251] [2023-11-12 02:30:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:11,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:30:11,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:11,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:30:11,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:30:11,237 INFO L87 Difference]: Start difference. First operand 188 states and 291 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:11,273 INFO L93 Difference]: Finished difference Result 281 states and 415 transitions. [2023-11-12 02:30:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:30:11,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-12 02:30:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:11,276 INFO L225 Difference]: With dead ends: 281 [2023-11-12 02:30:11,276 INFO L226 Difference]: Without dead ends: 281 [2023-11-12 02:30:11,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:30:11,278 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 55 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:11,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-12 02:30:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2023-11-12 02:30:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 247 states have (on average 1.591093117408907) internal successors, (393), 258 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2023-11-12 02:30:11,286 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 10 [2023-11-12 02:30:11,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:11,287 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2023-11-12 02:30:11,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2023-11-12 02:30:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 02:30:11,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:11,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:11,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:30:11,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:11,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2023-11-12 02:30:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:11,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844681107] [2023-11-12 02:30:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:30:11,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:30:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:30:11,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:30:11,346 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:30:11,347 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2023-11-12 02:30:11,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-11-12 02:30:11,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-11-12 02:30:11,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-11-12 02:30:11,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-11-12 02:30:11,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-11-12 02:30:11,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-11-12 02:30:11,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-11-12 02:30:11,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-11-12 02:30:11,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-11-12 02:30:11,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-11-12 02:30:11,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-11-12 02:30:11,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-11-12 02:30:11,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-11-12 02:30:11,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-11-12 02:30:11,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-11-12 02:30:11,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2023-11-12 02:30:11,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2023-11-12 02:30:11,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2023-11-12 02:30:11,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2023-11-12 02:30:11,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:30:11,357 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:11,361 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:30:11,385 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-12 02:30:11,386 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short11 could not be translated [2023-11-12 02:30:11,387 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated [2023-11-12 02:30:11,387 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch4 could not be translated [2023-11-12 02:30:11,388 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated [2023-11-12 02:30:11,388 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch4 could not be translated [2023-11-12 02:30:11,388 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-12 02:30:11,389 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short11 could not be translated [2023-11-12 02:30:11,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:30:11 BoogieIcfgContainer [2023-11-12 02:30:11,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:30:11,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:30:11,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:30:11,399 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:30:11,400 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:09" (3/4) ... [2023-11-12 02:30:11,401 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:30:11,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:30:11,403 INFO L158 Benchmark]: Toolchain (without parser) took 3601.07ms. Allocated memory was 115.3MB in the beginning and 178.3MB in the end (delta: 62.9MB). Free memory was 66.0MB in the beginning and 86.6MB in the end (delta: -20.6MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2023-11-12 02:30:11,404 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 115.3MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:30:11,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.93ms. Allocated memory is still 115.3MB. Free memory was 65.6MB in the beginning and 48.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 02:30:11,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.01ms. Allocated memory is still 115.3MB. Free memory was 48.1MB in the beginning and 46.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:30:11,405 INFO L158 Benchmark]: Boogie Preprocessor took 51.18ms. Allocated memory is still 115.3MB. Free memory was 46.1MB in the beginning and 44.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:30:11,405 INFO L158 Benchmark]: RCFGBuilder took 845.48ms. Allocated memory was 115.3MB in the beginning and 178.3MB in the end (delta: 62.9MB). Free memory was 44.3MB in the beginning and 138.2MB in the end (delta: -93.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2023-11-12 02:30:11,405 INFO L158 Benchmark]: TraceAbstraction took 1943.67ms. Allocated memory is still 178.3MB. Free memory was 137.5MB in the beginning and 86.6MB in the end (delta: 50.9MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2023-11-12 02:30:11,406 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 178.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:30:11,407 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 115.3MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.93ms. Allocated memory is still 115.3MB. Free memory was 65.6MB in the beginning and 48.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.01ms. Allocated memory is still 115.3MB. Free memory was 48.1MB in the beginning and 46.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.18ms. Allocated memory is still 115.3MB. Free memory was 46.1MB in the beginning and 44.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 845.48ms. Allocated memory was 115.3MB in the beginning and 178.3MB in the end (delta: 62.9MB). Free memory was 44.3MB in the beginning and 138.2MB in the end (delta: -93.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1943.67ms. Allocated memory is still 178.3MB. Free memory was 137.5MB in the beginning and 86.6MB in the end (delta: 50.9MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 178.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 1418 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 657 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 761 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=9, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 139 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-12 02:30:11,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/lockfree-3.2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:30:14,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:30:14,357 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-12 02:30:14,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:30:14,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:30:14,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:30:14,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:30:14,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:30:14,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:30:14,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:30:14,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:30:14,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:30:14,406 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:30:14,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:30:14,408 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:30:14,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:30:14,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:30:14,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:30:14,410 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:30:14,410 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:30:14,411 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:30:14,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:30:14,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:30:14,413 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:30:14,413 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:30:14,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:30:14,414 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:30:14,415 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:30:14,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:30:14,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:30:14,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:30:14,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:30:14,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:30:14,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:30:14,420 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:30:14,420 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:30:14,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:30:14,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:30:14,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:30:14,422 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:30:14,422 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:30:14,423 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 [2023-11-12 02:30:14,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:30:14,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:30:14,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:30:14,870 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:30:14,870 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:30:14,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/memsafety/lockfree-3.2.i [2023-11-12 02:30:18,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:30:18,468 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:30:18,469 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/sv-benchmarks/c/memsafety/lockfree-3.2.i [2023-11-12 02:30:18,497 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/data/a287ba7b2/379ccf7e3fe845988cfc250ad7e97175/FLAGd22e7f9d6 [2023-11-12 02:30:18,511 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/data/a287ba7b2/379ccf7e3fe845988cfc250ad7e97175 [2023-11-12 02:30:18,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:30:18,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:30:18,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:30:18,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:30:18,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:30:18,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:30:18" (1/1) ... [2023-11-12 02:30:18,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560c44e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:18, skipping insertion in model container [2023-11-12 02:30:18,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:30:18" (1/1) ... [2023-11-12 02:30:18,571 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:30:18,926 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:30:18,943 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:30:19,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:30:19,128 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:30:19,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19 WrapperNode [2023-11-12 02:30:19,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:30:19,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:30:19,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:30:19,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:30:19,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,223 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 126 [2023-11-12 02:30:19,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:30:19,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:30:19,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:30:19,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:30:19,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:30:19,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:30:19,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:30:19,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:30:19,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (1/1) ... [2023-11-12 02:30:19,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:30:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:30:19,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:30:19,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:30:19,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-12 02:30:19,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:30:19,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:30:19,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:30:19,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:30:19,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:30:19,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 02:30:19,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:30:19,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:30:19,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:30:19,594 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:30:19,596 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:30:20,120 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:30:20,127 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:30:20,128 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 02:30:20,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:20 BoogieIcfgContainer [2023-11-12 02:30:20,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:30:20,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:30:20,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:30:20,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:30:20,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:30:18" (1/3) ... [2023-11-12 02:30:20,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdbd761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:30:20, skipping insertion in model container [2023-11-12 02:30:20,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:19" (2/3) ... [2023-11-12 02:30:20,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdbd761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:30:20, skipping insertion in model container [2023-11-12 02:30:20,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:20" (3/3) ... [2023-11-12 02:30:20,141 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.2.i [2023-11-12 02:30:20,162 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:30:20,163 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-11-12 02:30:20,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:30:20,238 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@40b75900, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:30:20,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-11-12 02:30:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 02:30:20,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:20,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:30:20,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:20,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2023-11-12 02:30:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:30:20,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992812511] [2023-11-12 02:30:20,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:20,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:30:20,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:30:20,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-12 02:30:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:20,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:30:20,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:20,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:30:20,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:30:20,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992812511] [2023-11-12 02:30:20,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992812511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:20,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:20,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466947670] [2023-11-12 02:30:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:20,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:30:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:30:20,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:30:20,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:30:20,506 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:20,526 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2023-11-12 02:30:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:30:20,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-12 02:30:20,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:20,539 INFO L225 Difference]: With dead ends: 64 [2023-11-12 02:30:20,539 INFO L226 Difference]: Without dead ends: 62 [2023-11-12 02:30:20,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:30:20,546 INFO L413 NwaCegarLoop]: 81 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, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:20,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-12 02:30:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-12 02:30:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-11-12 02:30:20,586 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2023-11-12 02:30:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:20,587 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-11-12 02:30:20,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-11-12 02:30:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 02:30:20,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:20,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:20,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:20,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:20,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:20,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2023-11-12 02:30:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:30:20,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026494644] [2023-11-12 02:30:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:20,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:30:20,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:30:20,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-12 02:30:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:20,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:30:20,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:21,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:30:21,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:30:21,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026494644] [2023-11-12 02:30:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026494644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:21,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:30:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39432801] [2023-11-12 02:30:21,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:21,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:30:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:30:21,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:30:21,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:30:21,079 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:21,213 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2023-11-12 02:30:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:30:21,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 02:30:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:21,216 INFO L225 Difference]: With dead ends: 101 [2023-11-12 02:30:21,217 INFO L226 Difference]: Without dead ends: 101 [2023-11-12 02:30:21,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:30:21,219 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:21,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 208 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:30:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-12 02:30:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2023-11-12 02:30:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 78 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2023-11-12 02:30:21,244 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 7 [2023-11-12 02:30:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:21,244 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2023-11-12 02:30:21,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2023-11-12 02:30:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 02:30:21,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:21,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:21,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:21,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:21,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:21,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2023-11-12 02:30:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:30:21,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988813458] [2023-11-12 02:30:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:21,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:21,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:30:21,462 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:30:21,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-12 02:30:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:30:21,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:21,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:30:21,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:30:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988813458] [2023-11-12 02:30:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988813458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:21,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370740508] [2023-11-12 02:30:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:21,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:30:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:21,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:21,575 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:21,643 INFO L93 Difference]: Finished difference Result 126 states and 177 transitions. [2023-11-12 02:30:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:21,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 02:30:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:21,646 INFO L225 Difference]: With dead ends: 126 [2023-11-12 02:30:21,647 INFO L226 Difference]: Without dead ends: 126 [2023-11-12 02:30:21,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:21,648 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:21,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:30:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-12 02:30:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2023-11-12 02:30:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.9204545454545454) internal successors, (169), 107 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 169 transitions. [2023-11-12 02:30:21,672 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 169 transitions. Word has length 7 [2023-11-12 02:30:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:21,672 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 169 transitions. [2023-11-12 02:30:21,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 169 transitions. [2023-11-12 02:30:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 02:30:21,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:21,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:21,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:21,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:21,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:21,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2023-11-12 02:30:21,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:30:21,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623901759] [2023-11-12 02:30:21,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:21,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:21,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:30:21,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:30:21,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-12 02:30:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:30:21,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:21,995 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:30:21,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:30:21,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623901759] [2023-11-12 02:30:21,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623901759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:21,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:21,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:21,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284976955] [2023-11-12 02:30:21,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:21,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:30:21,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:22,002 INFO L87 Difference]: Start difference. First operand 108 states and 169 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:22,185 INFO L93 Difference]: Finished difference Result 203 states and 317 transitions. [2023-11-12 02:30:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 02:30:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:22,189 INFO L225 Difference]: With dead ends: 203 [2023-11-12 02:30:22,189 INFO L226 Difference]: Without dead ends: 200 [2023-11-12 02:30:22,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:22,191 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:22,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:30:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-12 02:30:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2023-11-12 02:30:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.8875) internal successors, (302), 179 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 302 transitions. [2023-11-12 02:30:22,209 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 302 transitions. Word has length 8 [2023-11-12 02:30:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:22,209 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 302 transitions. [2023-11-12 02:30:22,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 302 transitions. [2023-11-12 02:30:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 02:30:22,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:22,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:22,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:22,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:22,424 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:22,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:22,425 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2023-11-12 02:30:22,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:30:22,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215746556] [2023-11-12 02:30:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:22,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:22,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:30:22,429 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:30:22,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-12 02:30:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:30:22,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:22,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-12 02:30:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:22,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:30:22,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:30:22,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215746556] [2023-11-12 02:30:22,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215746556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:22,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:22,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:22,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323556211] [2023-11-12 02:30:22,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:22,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:22,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:30:22,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:22,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:22,555 INFO L87 Difference]: Start difference. First operand 180 states and 302 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:22,750 INFO L93 Difference]: Finished difference Result 270 states and 430 transitions. [2023-11-12 02:30:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:22,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 02:30:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:22,754 INFO L225 Difference]: With dead ends: 270 [2023-11-12 02:30:22,754 INFO L226 Difference]: Without dead ends: 270 [2023-11-12 02:30:22,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:22,755 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:22,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:30:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-11-12 02:30:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2023-11-12 02:30:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 231 states have (on average 1.800865800865801) internal successors, (416), 248 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 416 transitions. [2023-11-12 02:30:22,775 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 416 transitions. Word has length 8 [2023-11-12 02:30:22,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:22,775 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 416 transitions. [2023-11-12 02:30:22,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 416 transitions. [2023-11-12 02:30:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 02:30:22,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:22,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:22,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:23,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:23,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:23,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2023-11-12 02:30:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:30:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859058058] [2023-11-12 02:30:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:23,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:23,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:30:23,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:30:23,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-12 02:30:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:23,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:30:23,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:23,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 02:30:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:23,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:30:23,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:30:23,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859058058] [2023-11-12 02:30:23,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859058058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:23,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:23,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:23,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588692865] [2023-11-12 02:30:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:23,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:30:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:23,103 INFO L87 Difference]: Start difference. First operand 249 states and 416 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:23,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:23,293 INFO L93 Difference]: Finished difference Result 265 states and 417 transitions. [2023-11-12 02:30:23,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 02:30:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:23,296 INFO L225 Difference]: With dead ends: 265 [2023-11-12 02:30:23,296 INFO L226 Difference]: Without dead ends: 265 [2023-11-12 02:30:23,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:23,297 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:23,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:30:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-12 02:30:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2023-11-12 02:30:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 231 states have (on average 1.748917748917749) internal successors, (404), 246 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 404 transitions. [2023-11-12 02:30:23,310 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 404 transitions. Word has length 8 [2023-11-12 02:30:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:23,310 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 404 transitions. [2023-11-12 02:30:23,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 404 transitions. [2023-11-12 02:30:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 02:30:23,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:23,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:23,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:23,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:23,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:23,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2023-11-12 02:30:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:30:23,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182482795] [2023-11-12 02:30:23,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:23,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:23,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:30:23,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:30:23,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-12 02:30:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:23,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:30:23,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:23,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:30:23,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:30:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182482795] [2023-11-12 02:30:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182482795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:23,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:23,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:30:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731270750] [2023-11-12 02:30:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:23,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:30:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:30:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:30:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:30:23,606 INFO L87 Difference]: Start difference. First operand 247 states and 404 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:23,645 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2023-11-12 02:30:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:30:23,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-12 02:30:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:23,647 INFO L225 Difference]: With dead ends: 210 [2023-11-12 02:30:23,647 INFO L226 Difference]: Without dead ends: 210 [2023-11-12 02:30:23,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:30:23,648 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 53 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:23,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 193 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-12 02:30:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 183. [2023-11-12 02:30:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 171 states have (on average 1.672514619883041) internal successors, (286), 182 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 286 transitions. [2023-11-12 02:30:23,656 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 286 transitions. Word has length 9 [2023-11-12 02:30:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:23,657 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 286 transitions. [2023-11-12 02:30:23,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 286 transitions. [2023-11-12 02:30:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 02:30:23,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:23,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:23,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-12 02:30:23,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:23,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:23,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2023-11-12 02:30:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:30:23,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937313105] [2023-11-12 02:30:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:30:23,873 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:30:23,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-12 02:30:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:23,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:30:23,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:23,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:30:23,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:30:23,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937313105] [2023-11-12 02:30:23,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937313105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:23,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:23,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:30:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073962301] [2023-11-12 02:30:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:23,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:30:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:30:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:30:23,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:30:23,967 INFO L87 Difference]: Start difference. First operand 183 states and 286 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:24,028 INFO L93 Difference]: Finished difference Result 271 states and 405 transitions. [2023-11-12 02:30:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:30:24,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-12 02:30:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:24,031 INFO L225 Difference]: With dead ends: 271 [2023-11-12 02:30:24,032 INFO L226 Difference]: Without dead ends: 271 [2023-11-12 02:30:24,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:30:24,034 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 55 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:24,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-12 02:30:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 249. [2023-11-12 02:30:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 237 states have (on average 1.6160337552742616) internal successors, (383), 248 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 383 transitions. [2023-11-12 02:30:24,050 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 383 transitions. Word has length 10 [2023-11-12 02:30:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:24,050 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 383 transitions. [2023-11-12 02:30:24,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:30:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 383 transitions. [2023-11-12 02:30:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 02:30:24,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:24,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:24,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:24,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:24,254 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-11-12 02:30:24,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2023-11-12 02:30:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:30:24,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445193268] [2023-11-12 02:30:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:24,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:24,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:30:24,257 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:30:24,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-12 02:30:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:30:24,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:30:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:30:24,456 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-12 02:30:24,456 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:30:24,457 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2023-11-12 02:30:24,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-11-12 02:30:24,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-11-12 02:30:24,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-11-12 02:30:24,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-11-12 02:30:24,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-11-12 02:30:24,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-11-12 02:30:24,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-11-12 02:30:24,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-11-12 02:30:24,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-11-12 02:30:24,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-11-12 02:30:24,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-11-12 02:30:24,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-11-12 02:30:24,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-11-12 02:30:24,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-11-12 02:30:24,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-11-12 02:30:24,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2023-11-12 02:30:24,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2023-11-12 02:30:24,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2023-11-12 02:30:24,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2023-11-12 02:30:24,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:24,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:30:24,668 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:24,671 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:30:24,696 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-12 02:30:24,697 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short11 could not be translated [2023-11-12 02:30:24,698 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch4 could not be translated [2023-11-12 02:30:24,698 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated [2023-11-12 02:30:24,699 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated [2023-11-12 02:30:24,699 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch4 could not be translated [2023-11-12 02:30:24,699 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short11 could not be translated [2023-11-12 02:30:24,700 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-12 02:30:24,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:30:24 BoogieIcfgContainer [2023-11-12 02:30:24,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:30:24,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:30:24,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:30:24,708 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:30:24,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:20" (3/4) ... [2023-11-12 02:30:24,711 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:30:24,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:30:24,713 INFO L158 Benchmark]: Toolchain (without parser) took 6197.27ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 48.0MB in the beginning and 50.7MB in the end (delta: -2.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2023-11-12 02:30:24,713 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 73.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:30:24,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.83ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 47.8MB in the beginning and 63.0MB in the end (delta: -15.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-11-12 02:30:24,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.74ms. Allocated memory is still 90.2MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:30:24,715 INFO L158 Benchmark]: Boogie Preprocessor took 81.49ms. Allocated memory is still 90.2MB. Free memory was 60.7MB in the beginning and 58.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:30:24,715 INFO L158 Benchmark]: RCFGBuilder took 823.23ms. Allocated memory is still 90.2MB. Free memory was 58.7MB in the beginning and 61.9MB in the end (delta: -3.1MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2023-11-12 02:30:24,716 INFO L158 Benchmark]: TraceAbstraction took 4574.30ms. Allocated memory is still 90.2MB. Free memory was 61.5MB in the beginning and 50.7MB in the end (delta: 10.8MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-11-12 02:30:24,716 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 90.2MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:30:24,718 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 73.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.83ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 47.8MB in the beginning and 63.0MB in the end (delta: -15.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.74ms. Allocated memory is still 90.2MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.49ms. Allocated memory is still 90.2MB. Free memory was 60.7MB in the beginning and 58.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 823.23ms. Allocated memory is still 90.2MB. Free memory was 58.7MB in the beginning and 61.9MB in the end (delta: -3.1MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4574.30ms. Allocated memory is still 90.2MB. Free memory was 61.5MB in the beginning and 50.7MB in the end (delta: 10.8MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 90.2MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 1267 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 584 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 683 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 148 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 149 SizeOfPredicates, 5 NumberOfNonLiveVariables, 310 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-12 02:30:24,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_048f3561-0f9f-4956-8d5b-5a1b5fe62668/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample